Видео курса

  • Урок 1. 00:03:24
    Course Introduction
  • Урок 2. 00:02:46
    The Goal of The Course
  • Урок 3. 00:03:27
    How To Get The Most From This Course
  • Урок 4. 00:03:30
    Helpful Supplementary Material
  • Урок 5. 00:02:52
    Should You Time Yourself?
  • Урок 6. 00:04:45
    Closing Thoughts
  • Урок 7. 00:05:17
    Introducing Asymptotic Measures
  • Урок 8. 00:04:56
    O(1) Time (“Constant Time”)
  • Урок 9. 00:16:05
    O(log(n)) (“Logarithmic Time”)
  • Урок 10. 00:13:55
    O(n) (“Linear Time”)
  • Урок 11. 00:15:20
    O(n * log(n))
  • Урок 12. 00:11:07
    O(n!) ("Factorial Time")
  • Урок 13. 00:21:22
    O(|V| + |E|)
  • Урок 14. 00:25:25
    Approximating Time Complexities of Recursive Functions
  • Урок 15. 00:15:16
    Useful Recurrence Generalizations
  • Урок 16. 00:08:54
    The Master Theorem
  • Урок 17. 00:09:37
    Memoization
  • Урок 18. 00:10:31
    Check If A Number Is A Palindrome
  • Урок 19. 00:13:14
    Changing Base
  • Урок 20. 00:12:45
    The 3-Sum Problem
  • Урок 21. 00:16:48
    Fundamentals: Linked Lists
  • Урок 22. 00:09:06
    Design A Linked List
  • Урок 23. 00:11:26
    Even Odd Partition
  • Урок 24. 00:20:05
    Swap Linked List Nodes In Pairs
  • Урок 25. 00:12:40
    Sublist Reversal
  • Урок 26. 00:11:27
    Testing For Cycles
  • Урок 27. 00:06:56
    Testing For Overlapping Lists (No Cycles)
  • Урок 28. 00:09:13
    Remove kth Last Element
  • Урок 29. 00:11:59
    Right Shift A Singly Linked List
  • Урок 30. 00:13:39
    Add 2 Integers Represented As Linked Lists
  • Урок 31. 00:10:14
    Flatten A Multilevel Doubly Linked List
  • Урок 32. 00:20:01
    The Balanced Parentheses Problem
  • Урок 33. 00:11:47
    Compute Buildings With A Sunset View
  • Урок 34. 00:07:42
    Implement A Circular Queue
  • Урок 35. 00:13:36
    Implement A Queue With A Max API
  • Урок 36. 00:11:42
    Implement Text Editor Undo/Redo
  • Урок 37. 00:16:34
    Longest Node To Node Path In A Binary Tree
  • Урок 38. 00:11:52
    Test If A Binary Tree Is Symmetric
  • Урок 39. 00:16:14
    Sum Root To Leaf Paths
  • Урок 40. 00:17:40
    Compute A Node's Inorder Successor
  • Урок 41. 00:20:23
    Tree Reconstruction
  • Урок 42. 00:13:55
    Test A Tree For The BST Property
  • Урок 43. 00:06:55
    Build A Min-Height BST From A Sorted Array
  • Урок 44. 00:13:53
    Insertion & Deletion In A BST
  • Урок 45. 00:19:20
    Populating Level Pointers
  • Урок 46. 00:12:39
    Inorder Traversal Without Recursion
  • Урок 47. 00:10:58
    Implement A Trie
  • Урок 48. 00:13:43
    Fundamentals: Heaps
  • Урок 49. 00:16:36
    Merge K Sorted Arrays
  • Урок 50. 00:08:10
    K Largest/Smallest Elements In An Array
  • Урок 51. 00:13:46
    Compute The Median of Online Data
  • Урок 52. 00:08:32
    K Largest Elements In An Immutable Max-Heap
  • Урок 53. 00:11:35
    Intersection of 2 Sorted Arrays
  • Урок 54. 00:10:27
    Minimum Item In A Rotated Sorted Array
  • Урок 55. 00:14:38
    Fundamentals: Hashtables
  • Урок 56. 00:16:44
    Implement An LRU Cache
  • Урок 57. 00:07:56
    Nearest Repeated Entries In An Array
  • Урок 58. 00:15:27
    Naive Sorting Algorithms & Applications (Bubble, Insertion, Selection)
  • Урок 59. 00:20:03
    The Most Visited Pages Problem
  • Урок 60. 00:09:08
    Divide & Conquer Methodology
  • Урок 61. 00:19:04
    Implement A Sudoku Solver
  • Урок 62. 00:19:41
    Search A Linked List With Jump References
  • Урок 63. 00:13:12
    Phone Number Mnemonics
  • Урок 64. 00:13:20
    IP Address Restoration
  • Урок 65. 00:18:18
    The N Queens Problem
  • Урок 66. 00:07:06
    Permutations
  • Урок 67. 00:10:12
    Generate The Powerset
  • Урок 68. 00:11:31
    Generate All Subsets of Size K
  • Урок 69. 00:07:08
    Palindromic Decompositions
  • Урок 70. 00:14:02
    Generate Unique Binary Search Trees
  • Урок 71. 00:23:38
    Fundamentals: Dynamic Programming
  • Урок 72. 00:24:10
    Score Combinations (Total Ways To Make Change)
  • Урок 73. 00:13:49
    Buy & Sell Stock Once
  • Урок 74. 00:10:32
    Number of Ways To Traverse A Matrix
  • Урок 75. 00:06:36
    Minimum Weight Path In A Triangle
  • Урок 76. 00:16:01
    Decode Ways
  • Урок 77. 00:15:58
    Levenshtein Distance
  • Урок 78. 00:16:32
    Longest Non-Decreasing Subsequence
  • Урок 79. 00:20:25
    The 0/1 Knapsack Problem
  • Урок 80. 00:22:52
    DNA Sequence Alignment
  • Урок 81. 00:11:27
    1D Subproblems vs. 2D Subproblems
  • Урок 82. 00:05:47
    Fundamentals: Greedy Algorithms
  • Урок 83. 00:19:46
    Fundamentals: Graphs
  • Урок 84. 00:21:27
    Depth First Search & Breadth First Search
  • Урок 85. 00:14:35
    Keys & Rooms
  • Урок 86. 00:10:29
    Search A Maze For An Exit
  • Урок 87. 00:16:00
    Paint A Matrix
  • Урок 88. 00:13:19
    Compute Enclosed Regions
  • Урок 89. 00:20:17
    Detect A Cycle In A Graph (Deadlock Detection)
  • Урок 90. 00:17:29
    String Transformations
  • Урок 91. 00:13:09
    Topological Sorting On A Digraph
  • Урок 92. 00:15:28
    Check If A Graph Is Bipartite
  • Урок 93. 00:11:44
    Clone A Graph
  • Урок 94. 00:20:38
    Testing Strong Connectivity
  • Урок 95. 00:14:00
    Directory Access (Dropbox)
Этот курс находится в платной подписке. Оформи премиум подписку и смотри Coding Interview Class, а также все другие курсы, прямо сейчас!
Премиум FAQ