Section 1 : Introduction and Settings
|
Lecture 1 | Introduction | 00:02:57 Duration |
|
Lecture 2 | INTRODUCTION TO BRAINMEASURES PROCTOR SYSTEM | |
|
Lecture 3 | About Proctor Testing | |
|
Lecture 4 | Interview triks | 00:01:34 Duration |
|
Lecture 5 | Install Java JDK | 00:03:30 Duration |
|
Lecture 6 | Install Eclipse | 00:02:19 Duration |
|
Lecture 7 | Exercise files |
Section 2 : Code Complexity
|
Lecture 1 | Code Complexity Big-O, Omega and Theta | 00:13:54 Duration |
|
Lecture 2 | Big-O Examples | 00:13:59 Duration |
Section 3 : Data Structure
Section 4 : Collections In Java
|
Lecture 1 | Data Structure functions in Java | 00:03:06 Duration |
|
Lecture 2 | ArrayList | 00:06:16 Duration |
|
Lecture 3 | LinkedList | 00:02:34 Duration |
|
Lecture 4 | HashMap | 00:04:37 Duration |
|
Lecture 5 | TreeSet HashSet | 00:02:09 Duration |
|
Lecture 6 | Stack | 00:01:32 Duration |
|
Lecture 7 | Queue and Priority Queue | 00:11:03 Duration |
|
Lecture 8 | Sort array of Objects | 00:08:12 Duration |
|
Lecture 9 | Recursion | 00:17:27 Duration |
Section 5 : Searching Algorithms
|
Lecture 1 | Linear Search | 00:04:55 Duration |
|
Lecture 2 | Linear Search implementation in Java | 00:08:31 Duration |
|
Lecture 3 | Binary Search | 00:10:47 Duration |
|
Lecture 4 | Binary Search implementation in Java | 00:06:06 Duration |
|
Lecture 5 | Interpolation Search | 00:05:04 Duration |
|
Lecture 6 | Interpolation Search implementation in Java | 00:02:54 Duration |
Section 6 : Sorting Algorithms
|
Lecture 1 | Bubble sort | 00:07:02 Duration |
|
Lecture 2 | Bubble Sort implementation in Java | 00:05:20 Duration |
|
Lecture 3 | Selection Sort | 00:04:39 Duration |
|
Lecture 4 | Select Sort implementation in Java | 00:04:57 Duration |
|
Lecture 5 | Quick Sort | |
|
Lecture 6 | Quick Sort implementation in Java | 00:07:32 Duration |
|
Lecture 7 | Merge Sort | 00:07:56 Duration |
|
Lecture 8 | Merge Sort implementation in Java | 00:06:41 Duration |
|
Lecture 9 | Heap Sort | 00:09:07 Duration |
|
Lecture 10 | Heap Sort implementation in Java | 00:13:54 Duration |
|
Lecture 11 | Coding Interview Two words have same characters job interview | 00:10:44 Duration |
Section 7 : Tree Theory
|
Lecture 1 | Binary Tree and Binary Search Tree | 00:13:45 Duration |
|
Lecture 2 | Binary Search Tree implementation in Java | 00:12:09 Duration |
|
Lecture 3 | Amazon Interview Find path between two nodes | 00:24:30 Duration |
|
Lecture 4 | Facebook Interview Find if two binary search trees are equal | 00:12:01 Duration |
|
Lecture 5 | Google Interview Determines if two BST are equal ( Another solution) | 00:13:17 Duration |
|
Lecture 6 | Coding Interview Serialize and Deserialize a Binary Tree | |
|
Lecture 7 | Google Interview Question Check if two trees are Mirror | 00:11:32 Duration |
|
Lecture 8 | Amazon Interview Question Level by Level Printing of Binary Tree | 00:17:12 Duration |
|
Lecture 9 | HWFind SubTrees (Google Interview Question) | 00:03:35 Duration |
|
Lecture 10 | Problem of the Day | 00:06:16 Duration |
|
Lecture 11 | Red-Black Tree | 00:20:58 Duration |
Section 8 : Graph Theory
|
Lecture 1 | Matrix and Adjacency List | 00:15:10 Duration |
|
Lecture 2 | Depth First Search(DFS) | 00:07:27 Duration |
|
Lecture 3 | DFS implementation in Java | 00:19:03 Duration |
|
Lecture 4 | Breadth First Search (BFS) | 00:03:49 Duration |
|
Lecture 5 | BFS implementation in Java | 00:04:47 Duration |
|
Lecture 6 | Google Interview Word Break problem | 00:18:42 Duration |
|
Lecture 7 | Backtracking | 00:06:48 Duration |
|
Lecture 8 | Preorder and PostOrder | 00:03:52 Duration |
|
Lecture 9 | HWVisit Cities in best Weather (Google Interview Question) | 00:02:43 Duration |
|
Lecture 10 | Trip Planer Google Interview | 00:19:22 Duration |
|
Lecture 11 | Finding the shortest path ( Amazon + Google) Interview Question | 00:23:42 Duration |
|
Lecture 12 | HW Nearest post office HW explain (Microsoft Interview Question) | 00:10:06 Duration |
Section 9 : Short Path in Graph Theory
|
Lecture 1 | Nearest Neighbor and Shortest path | 00:07:17 Duration |
|
Lecture 2 | Dijkstra's Algorithm | 00:08:15 Duration |
|
Lecture 3 | A Algorithm | 00:16:38 Duration |
Section 10 : Dynamic Programming
|
Lecture 1 | Dynamic Programming concept | 00:06:01 Duration |
|
Lecture 2 | Edit distance | 00:12:46 Duration |
|
Lecture 3 | HWFind Word in list of characters | 00:00:53 Duration |
|
Lecture 4 | HWKnapsack problems | 00:02:11 Duration |
|
Lecture 5 | Knapsack solution in Java | 00:11:03 Duration |
Section 11 : NP Complete problems
|
Lecture 1 | NP Complete problems | 00:04:51 Duration |