Это пробный урок. Оформите подписку, чтобы получить доступ ко всем материалам курса. Премиум

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