Section 1 : Introduction and Settings

 		Lecture 1 Introduction 2:57
Lecture 2 INTRODUCTION TO BRAINMEASURES PROCTOR SYSTEM Pdf
Lecture 3 About Proctor Testing Pdf
Lecture 4 Interview triks 1:34
Lecture 5 Install Java JDK 3:30
Lecture 6 Install Eclipse 2:19
Lecture 7 Exercise files Text

Section 2 : Code Complexity

 		Lecture 8 Code Complexity Big-O, Omega and Theta 13:54
Lecture 9 Big-O Examples 13:59

Section 3 : Data Structure

 		Lecture 10 Why Data Structure 7:55
Lecture 11 One-Dimension Array
Lecture 12 One-Dimension Array implementation in Java 11:25
Lecture 13 Amazon Interview Find longest sequence of 1’s with one flip 19:25
Lecture 14 Two-Dimension Array 8:22
Lecture 15 Two-Dimension Array implementation in Java 5:35
Lecture 16 Facebook Interview Spiral Matrix 15:9
Lecture 17 Dynamic Array 8:11
Lecture 18 Dynamic Array implementation in Java 12:34
Lecture 19 Linked List 9:25
Lecture 20 Linked List implementation in Java 12:18
Lecture 21 Doubly Linked List implementation in Java 8:0
Lecture 22 Amazon Interview Remove Kth Node From End of List 13:48
Lecture 23 HWCombine two Linked List (Google Interview Question) 2:57
Lecture 24 Compare Linked List vs Array 5:46
Lecture 25 Hash-Table 14:38
Lecture 26 Hash-Table implementation in Java 18:49
Lecture 27 Amazon Interview Find unique number in Array 5:49
Lecture 28 Amazon Interview Key Phrase problem TF-IDF 15:20
Lecture 29 Stack 6:41
Lecture 30 Stack implementation in Java Use Array 9:7
Lecture 31 Amazon Interview Recursive Staircase Problem 13:29
Lecture 32 Uber Interview question word distance
Lecture 33 Coding Interview Parentheses Expression 11:59
Lecture 34 Stack implementation in Java Use Dynamic Array 4:47
Lecture 35 Stack implementation in Java Use Linked List 4:53
Lecture 36 Queue 5:49
Lecture 37 Queue implementation in Java Use Array
Lecture 38 Microsoft Interview question Friend Circles 17:16
Lecture 39 Queue implementation in Java Use Dynamic Array 3:43
Lecture 40 Queue implementation in Java Use Linked List 10:7
Lecture 41 Priority queue 3:44
Lecture 42 Amazon Interview Kth top movies 12:34
Lecture 43 HWBest data structure for Array With Many Zeros (Google Interview Question) 1:53

Section 4 : Collections In Java

 		Lecture 44 Data Structure functions in Java 3:6
Lecture 45 ArrayList 6:16
Lecture 46 LinkedList 2:34
Lecture 47 HashMap 4:37
Lecture 48 TreeSet HashSet 2:9
Lecture 49 Stack 1:32
Lecture 50 Queue and Priority Queue 11:3
Lecture 51 Sort array of Objects 8:12
Lecture 52 Recursion 17:27

Section 5 : Searching Algorithms

 		Lecture 53 Linear Search 4:55
Lecture 54 Linear Search implementation in Java 8:31
Lecture 55 Binary Search 10:47
Lecture 56 Binary Search implementation in Java 6:6
Lecture 57 Interpolation Search 5:4
Lecture 58 Interpolation Search implementation in Java 2:54

Section 6 : Sorting Algorithms

 		Lecture 59 Bubble sort 7:2
Lecture 60 Bubble Sort implementation in Java 5:20
Lecture 61 Selection Sort 4:39
Lecture 62 Select Sort implementation in Java 4:57
Lecture 63 Quick Sort
Lecture 64 Quick Sort implementation in Java 7:32
Lecture 65 Merge Sort 7:56
Lecture 66 Merge Sort implementation in Java 6:41
Lecture 67 Heap Sort 9:7
Lecture 68 Heap Sort implementation in Java 13:54
Lecture 69 Coding Interview Two words have same characters job interview 10:44

Section 7 : Tree Theory

 		Lecture 70 Binary Tree and Binary Search Tree 13:45
Lecture 71 Binary Search Tree implementation in Java 12:9
Lecture 72 Amazon Interview Find path between two nodes 24:30
Lecture 73 Facebook Interview Find if two binary search trees are equal 12:1
Lecture 74 Google Interview Determines if two BST are equal ( Another solution) 13:17
Lecture 75 Coding Interview Serialize and Deserialize a Binary Tree
Lecture 76 Google Interview Question Check if two trees are Mirror 11:32
Lecture 77 Amazon Interview Question Level by Level Printing of Binary Tree 17:12
Lecture 78 HWFind SubTrees (Google Interview Question) 3:35
Lecture 79 Problem of the Day 6:16
Lecture 80 Red-Black Tree 20:58

Section 8 : Graph Theory

 		Lecture 81 Matrix and Adjacency List 15:10
Lecture 82 Depth First Search(DFS) 7:27
Lecture 83 DFS implementation in Java 19:3
Lecture 84 Breadth First Search (BFS) 3:49
Lecture 85 BFS implementation in Java 4:47
Lecture 86 Google Interview Word Break problem 18:42
Lecture 87 Backtracking 6:48
Lecture 88 Preorder and PostOrder 3:52
Lecture 89 HWVisit Cities in best Weather (Google Interview Question) 2:43
Lecture 90 Trip Planer Google Interview 19:22
Lecture 91 Finding the shortest path ( Amazon + Google) Interview Question 23:42
Lecture 92 HW Nearest post office HW explain (Microsoft Interview Question) 10:6

Section 9 : Short Path in Graph Theory

 		Lecture 93 Nearest Neighbor and Shortest path 7:17
Lecture 94 Dijkstra's Algorithm 8:15
Lecture 95 A Algorithm 16:38

Section 10 : Dynamic Programming

 		Lecture 96 Dynamic Programming concept 6:1
Lecture 97 Edit distance 12:46
Lecture 98 HWFind Word in list of characters 0:53
Lecture 99 HWKnapsack problems 2:11
Lecture 100 Knapsack solution in Java 11:3

Section 11 : NP Complete problems

 		Lecture 101 NP Complete problems 4:51