• Урок 1. 00:06:09
    Getting Referrals
  • Урок 2. 00:05:53
    Effective Recruiter Communication
  • Урок 3. 00:04:30
    Online Code Screening Assessments
  • Урок 4. 00:06:13
    Standing Out From Other Candidates
  • Урок 5. 00:05:42
    The Technical Interview
  • Урок 6. 00:07:15
    The Behavioral Interview
  • Урок 7. 00:15:04
    Applying and the Resume
  • Урок 8. 00:05:17
    Introducing Asymptotic Measures
  • Урок 9. 00:23:16
    Asymptotic Bounding 101
  • Урок 10. 00:04:56
    O(1) Time “Constant Time”
  • Урок 11. 00:13:55
    O(n) "Linear Time"
  • Урок 12. 00:09:37
    Memoization
  • Урок 13. 00:16:05
    O(log(n)) “Logarithmic Time”
  • Урок 14. 00:15:20
    O(n * log(n))
  • Урок 15. 00:11:06
    O(n!) "Factorial Time"
  • Урок 16. 00:21:22
    O(|V| + |E|)
  • Урок 17. 00:08:54
    The Master Theorem
  • Урок 18. 00:15:16
    Useful Recurrence Generalizations
  • Урок 19. 00:25:25
    Approximating Time Complexities of Recursive Functions
  • Урок 20. 00:10:31
    Check If A Number Is A Palindrome
  • Урок 21. 00:08:59
    Reverse Bits
  • Урок 22. 00:13:14
    Changing Base
  • Урок 23. 00:16:04
    Rotating a 2D Matrix
  • Урок 24. 00:12:44
    The 3-Sum Problem
  • Урок 25. 00:14:40
    Enumerate All Primes To N
  • Урок 26. 00:12:19
    Spiral Traversal of A Matrix
  • Урок 27. 00:20:13
    Count Subarrays That Sum To K
  • Урок 28. 00:12:40
    Next Permutation
  • Урок 29. 00:12:25
    Pattern Matching
  • Урок 30. 00:12:08
    Longest Palindrome Construction
  • Урок 31. 00:12:56
    Zigzag Conversion
  • Урок 32. 00:23:50
    Word Subsets
  • Урок 33. 00:16:48
    Linked List Fundamentals
  • Урок 34. 00:09:06
    Design A Linked List
  • Урок 35. 00:11:26
    Even Odd Partition
  • Урок 36. 00:06:55
    Testing For Overlapping Lists (No Cycles)
  • Урок 37. 00:09:13
    Remove kth To Last Element
  • Урок 38. 00:11:59
    Right Shift A Singly Linked List
  • Урок 39. 00:13:39
    Add 2 Integers Represented As Linked Lists
  • Урок 40. 00:20:04
    Swap Linked List Nodes In Pairs
  • Урок 41. 00:11:27
    Testing For Cycles
  • Урок 42. 00:17:38
    Clone A Linked List (With Random Pointers)
  • Урок 43. 00:12:40
    Sublist Reversal
  • Урок 44. 00:10:14
    Flatten A Multilevel Doubly Linked List
  • Урок 45. 00:20:01
    The Balanced Parentheses Problem
  • Урок 46. 00:11:47
    Compute Buildings With A Sunset View
  • Урок 47. 00:11:42
    Implement Text Editor Undo Redo
  • Урок 48. 00:07:42
    Implement A Circular Queue
  • Урок 49. 00:13:36
    Implement A Queue With A Max API
  • Урок 50. 00:15:00
    Implement A Queue Using Stacks
  • Урок 51. 00:11:52
    Test If A Binary Tree Is Symmetric
  • Урок 52. 00:16:14
    Sum Root To Leaf Paths
  • Урок 53. 00:13:55
    Test A Tree For The BST Property
  • Урок 54. 00:06:55
    Build A Min-Height BST From A Sorted Array
  • Урок 55. 00:20:00
    Binary Tree Bootcamp
  • Урок 56. 00:06:12
    Lowest Common Ancestor In A BST
  • Урок 57. 00:16:34
    Binary Tree Diameter
  • Урок 58. 00:12:39
    Inorder Traversal Without Recursion
  • Урок 59. 00:20:23
    Tree Reconstruction
  • Урок 60. 00:13:53
    Insertion and Deletion In A BST
  • Урок 61. 00:19:20
    Populating Level Pointers
  • Урок 62. 00:14:17
    Test If A Binary Tree Is Height Balanced
  • Урок 63. 00:15:19
    Serialize and Deserialize A Binary Tree
  • Урок 64. 00:17:40
    Compute A Node's Inorder Successor
  • Урок 65. 00:10:58
    Implement A Trie
  • Урок 66. 00:32:48
    AVL Trees & Rotations
  • Урок 67. 00:13:43
    Heaps Fundamentals
  • Урок 68. 00:08:10
    K Smallest Elements In An Array
  • Урок 69. 00:08:32
    K Largest Elements In An Immutable Max-Heap
  • Урок 70. 00:20:19
    Implement A Binary Heap
  • Урок 71. 00:16:36
    Merge K Sorted Lists
  • Урок 72. 00:13:46
    Compute The Median of Online Data
  • Урок 73. 00:11:35
    Intersection of 2 Sorted Arrays
  • Урок 74. 00:10:27
    Minimum Item In A Rotated Sorted Array
  • Урок 75. 00:29:31
    Search A 2D Sorted Matrix
  • Урок 76. 00:29:13
    Find the k'th Largest or Smallest Element
  • Урок 77. 00:14:38
    Hashtable Fundamentals
  • Урок 78. 00:07:56
    Nearest Repeated Entries In An Array
  • Урок 79. 00:16:44
    Implement An LRU Cache
  • Урок 80. 00:22:34
    Minimum Window Substring
  • Урок 81. 00:15:27
    Naive Sorting Algorithms (Bubble, Insertion, Selection)
  • Урок 82. 00:36:50
    Merge Sort
  • Урок 83. 00:26:31
    Quicksort
  • Урок 84. 00:14:25
    Sort A K Sorted Array
  • Урок 85. 00:40:18
    Heapsort
  • Урок 86. 00:20:03
    The Most Visited Pages Problem
  • Урок 87. 00:19:41
    Search A Linked List With Jump References
  • Урок 88. 00:13:44
    The Backtracking Blueprint
  • Урок 89. 00:09:08
    Divide and Conquer Methodology
  • Урок 90. 00:13:12
    Phone Number Mnemonics
  • Урок 91. 00:13:20
    IP Address Restoration
  • Урок 92. 00:10:12
    Generate The Powerset
  • Урок 93. 00:07:08
    Palindromic Decompositions
  • Урок 94. 00:07:06
    Permutations
  • Урок 95. 00:19:04
    Implement A Sudoku Solver
  • Урок 96. 00:18:18
    The N Queens Problem
  • Урок 97. 00:11:31
    Generate All Subsets of Size K
  • Урок 98. 00:12:01
    Generate All Strings With n Matched Parentheses
  • Урок 99. 00:23:38
    Dynamic Programming Fundamentals
  • Урок 100. 00:13:49
    Buy and Sell Stock Once
  • Урок 101. 00:10:32
    Number of Ways To Traverse A Matrix
  • Урок 102. 00:06:36
    Minimum Weight Path In A Triangle
  • Урок 103. 00:11:27
    1D Subproblems vs. 2D Subproblems
  • Урок 104. 00:24:10
    Score Combinations
  • Урок 105. 00:16:01
    Decode Ways
  • Урок 106. 00:23:12
    The Change Making Problem
  • Урок 107. 00:20:25
    The 0-1 Knapsack Problem
  • Урок 108. 00:15:58
    Levenshtein Distance
  • Урок 109. 00:16:32
    Longest Non-Decreasing Subsequence
  • Урок 110. 00:22:52
    DNA Sequence Alignment
  • Урок 111. 00:19:38
    Max Contiguous Subarray Sum
  • Урок 112. 00:25:31
    Longest Common Subsequence
  • Урок 113. 00:05:47
    Greedy Algorithms Fundamentals
  • Урок 114. 00:10:41
    Erase Interval Overlaps
  • Урок 115. 00:20:20
    Interval Scheduling Maximization
  • Урок 116. 00:11:51
    Minimum Spanning Trees
  • Урок 117. 00:20:36
    Dijkstra's vs Prim's
  • Урок 118. 00:08:37
    Scheduling To Minimize Wait Time
  • Урок 119. 00:19:46
    Graphs Fundamentals
  • Урок 120. 00:21:27
    Depth First Search and Breadth First Search
  • Урок 121. 00:14:35
    Keys and Rooms
  • Урок 122. 00:16:00
    Paint A Matrix
  • Урок 123. 00:12:56
    Binary Tree Level Order Traversal
  • Урок 124. 00:15:28
    Check If A Graph Is Bipartite
  • Урок 125. 00:10:29
    Search A Maze For An Exit
  • Урок 126. 00:13:19
    Compute Enclosed Regions
  • Урок 127. 00:20:17
    Detect A Cycle In A Graph (Deadlock Detection)
  • Урок 128. 00:17:29
    String Transformations
  • Урок 129. 00:13:09
    Topological Sorting
  • Урок 130. 00:20:38
    Testing Strong Connectivity
  • Урок 131. 00:11:44
    Clone A Graph
  • Урок 132. 00:15:55
    All Nodes Distance K In A Binary Tree
  • Урок 133. 00:14:00
    Directory Access (Dropbox)
  • Урок 134. 00:11:14
    Concurrency Fundamentals
Этот курс находится в платной подписке. Оформи премиум подписку и смотри Coding Interview Class (Back To Back SWE), а также все другие курсы, прямо сейчас!
Премиум