-
Урок 1.
00:02:58
Introduction
-
Урок 2.
00:01:29
Course content
-
Урок 3.
00:01:34
Interview triks
-
Урок 4.
00:03:31
Install Java JDK
-
Урок 5.
00:02:20
Install Eclipse
-
Урок 6.
00:13:55
Code Complexity|| Big-O, Omega and Theta
-
Урок 7.
00:14:00
Big-O Examples
-
Урок 8.
00:07:56
Why Data Structure?
-
Урок 9.
00:16:21
Top Big Tech Interview Questions 1: Math
-
Урок 10.
00:13:36
One-Dimension Array
-
Урок 11.
00:11:26
One-Dimension Array implementation in Java
-
Урок 12.
00:21:58
Top Big Tech Interview Questions 2: Slicing ( Container With Most Water)
-
Урок 13.
00:19:26
Amazon Interview: Find longest sequence of 1’s with one flip
-
Урок 14.
00:08:23
Two-Dimension Array
-
Урок 15.
00:05:36
Two-Dimension Array implementation in Java
-
Урок 16.
00:15:09
Facebook Interview: Spiral Matrix
-
Урок 17.
00:08:12
Dynamic Array
-
Урок 18.
00:12:35
Dynamic Array implementation in Java
-
Урок 19.
00:09:25
Linked List
-
Урок 20.
00:12:18
Linked List implementation in Java
-
Урок 21.
00:08:00
Doubly Linked List implementation in Java
-
Урок 22.
00:13:49
Amazon Interview: Remove Kth Node From End of List
-
Урок 23.
00:02:58
HW||Combine two Linked List (Google Interview Question)
-
Урок 24.
00:05:46
Compare Linked List vs Array
-
Урок 25.
00:14:39
Hash-Table
-
Урок 26.
00:18:50
Hash-Table implementation in Java
-
Урок 27.
00:31:07
Top Tech Interview Question 3 Map
-
Урок 28.
00:05:49
Amazon Interview: Find unique number in Array
-
Урок 29.
00:15:21
Amazon Interview: Key Phrase problem: TF-IDF
-
Урок 30.
00:06:42
Stack
-
Урок 31.
00:09:08
Stack implementation in Java Use Array
-
Урок 32.
00:13:29
Amazon Interview: Recursive Staircase Problem
-
Урок 33.
00:17:16
Uber Interview question: word distance
-
Урок 34.
00:12:00
Coding Interview : Parentheses Expression
-
Урок 35.
00:04:48
Stack implementation in Java Use Dynamic Array
-
Урок 36.
00:04:53
Stack implementation in Java Use Linked List
-
Урок 37.
00:05:49
Queue
-
Урок 38.
00:09:06
Queue implementation in Java Use Array
-
Урок 39.
00:17:16
Microsoft Interview question: Friend Circles
-
Урок 40.
00:03:44
Queue implementation in Java Use Dynamic Array
-
Урок 41.
00:10:08
Queue implementation in Java Use Linked List
-
Урок 42.
00:01:54
HW||Best data structure for Array With Many Zeros (Google Interview Question)
-
Урок 43.
00:03:45
Priority queue
-
Урок 44.
00:12:34
Amazon Interview: Kth top movies
-
Урок 45.
00:36:48
Top Tech Interview Question 4 Trie (Search Engine)
-
Урок 46.
00:17:28
Recursion
-
Урок 47.
00:30:51
Phone Interview Question For Software Engineer With Big Tech
-
Урок 48.
00:03:07
Data Structure functions in Java
-
Урок 49.
00:06:17
ArrayList
-
Урок 50.
00:02:35
LinkedList
-
Урок 51.
00:04:37
HashMap
-
Урок 52.
00:02:09
TreeSet HashSet
-
Урок 53.
00:01:33
Stack
-
Урок 54.
00:11:03
Queue and Priority Queue
-
Урок 55.
00:08:12
Sort array of Objects
-
Урок 56.
00:04:56
Linear Search
-
Урок 57.
00:08:31
Linear Search implementation in Java
-
Урок 58.
00:10:47
Binary Search
-
Урок 59.
00:06:07
Binary Search implementation in Java
-
Урок 60.
00:05:04
Interpolation Search
-
Урок 61.
00:02:55
Interpolation Search implementation in Java
-
Урок 62.
00:07:03
Bubble sort
-
Урок 63.
00:05:21
Bubble Sort implementation in Java
-
Урок 64.
00:04:40
Selection Sort
-
Урок 65.
00:04:57
Select Sort implementation in Java
-
Урок 66.
00:05:44
Quick Sort
-
Урок 67.
00:07:33
Quick Sort implementation in Java
-
Урок 68.
00:07:57
Merge Sort
-
Урок 69.
00:06:41
Merge Sort implementation in Java
-
Урок 70.
00:09:08
Heap Sort
-
Урок 71.
00:13:54
Heap Sort implementation in Java
-
Урок 72.
00:10:45
Coding Interview: Two words have same characters job interview
-
Урок 73.
00:13:45
Binary Tree and Binary Search Tree
-
Урок 74.
00:12:10
Binary Search Tree implementation in Java
-
Урок 75.
00:24:31
Amazon Interview: Find path between two nodes
-
Урок 76.
00:12:01
Facebook Interview: Find if two binary search trees are equal
-
Урок 77.
00:13:18
Google Interview: Determines if two BST are equal ( Another solution)
-
Урок 78.
00:16:02
Coding Interview: Serialize and Deserialize a Binary Tree
-
Урок 79.
00:11:32
Google Interview Question: Check if two trees are Mirror
-
Урок 80.
00:17:13
Amazon Interview Question: Level by Level Printing of Binary Tree
-
Урок 81.
00:03:35
HW||Find SubTrees (Google Interview Question)
-
Урок 82.
00:06:16
Problem of the Day
-
Урок 83.
00:20:59
Red-Black Tree
-
Урок 84.
00:15:11
Matrix and Adjacency List
-
Урок 85.
00:07:27
Depth First Search(DFS)
-
Урок 86.
00:19:04
DFS implementation in Java
-
Урок 87.
00:03:49
Breadth First Search (BFS)
-
Урок 88.
00:04:47
BFS implementation in Java
-
Урок 89.
00:18:43
Google Interview: Word Break problem
-
Урок 90.
00:06:49
Backtracking
-
Урок 91.
00:03:52
Preorder and PostOrder
-
Урок 92.
00:02:44
HW||Visit Cities in best Weather (Google Interview Question)
-
Урок 93.
00:19:22
Trip Planer Google Interview
-
Урок 94.
00:23:42
Finding the shortest path ( Amazon + Google) Interview Question
-
Урок 95.
00:10:06
HW|| Nearest post office HW explain (Microsoft Interview Question)
-
Урок 96.
00:07:18
Nearest Neighbor and Shortest path
-
Урок 97.
00:08:16
Dijkstra's Algorithm
-
Урок 98.
00:16:39
A* Algorithm
-
Урок 99.
00:06:02
Dynamic Programming concept
-
Урок 100.
00:12:46
Edit distance
-
Урок 101.
00:00:53
HW||Find Word in list of characters
-
Урок 102.
00:02:12
HW||Knapsack problems
-
Урок 103.
00:11:03
Knapsack solution in Java
-
Урок 104.
00:04:51
NP Complete problems