Этот материал находится в платной подписке. Оформи премиум подписку и смотри The Bible of Coding Interviews and Competitive Programming, а также все другие курсы, прямо сейчас!
Премиум
  • Урок 1. 00:02:24
    How to take this Course
  • Урок 2. 00:04:48
    Prime Number Test
  • Урок 3. 00:08:45
    Prime Number Test - Implementation
  • Урок 4. 00:10:07
    Prime Factorization
  • Урок 5. 00:06:57
    Prime Factorization - Implementation
  • Урок 6. 00:07:25
    Sieve of Eratosthenes
  • Урок 7. 00:07:15
    Sieve of Eratosthenes - Implementation
  • Урок 8. 00:07:34
    Fast Modular Exponentiation
  • Урок 9. 00:07:03
    Fast Modular Exponentiation - Recursive Implementation
  • Урок 10. 00:12:21
    Fast Modular Exponentiation - Iterative Implementation
  • Урок 11. 00:06:16
    Pigeonhole Principle Problem
  • Урок 12. 00:02:36
    Pigeonhole Principle - Implementation
  • Урок 13. 00:06:14
    Partial Sums
  • Урок 14. 00:01:09
    Partial Sums - Implementation
  • Урок 15. 00:10:42
    Range Update Trick
  • Урок 16. 00:05:21
    Frequency Array
  • Урок 17. 00:12:12
    Maximum Sum Subarray - Greedy Approach
  • Урок 18. 00:02:27
    Maximum Sum Subarray - Greedy Approach Implementation
  • Урок 19. 00:08:29
    Maximum Sum Subarray - Partial Sums Approach
  • Урок 20. 00:04:50
    Maximum Sum Subarray - Partial Sums Approach Implementation
  • Урок 21. 00:09:45
    Longest Consecutive Numbers Subarray
  • Урок 22. 00:06:34
    Longest Consecutive Numbers Subarray - Implementation
  • Урок 23. 00:06:04
    Introduction to Sliding Window Technique + Problem Example
  • Урок 24. 00:09:19
    Sliding Window Technique Solution
  • Урок 25. 00:13:51
    Sliding Window Technique Solution - Implementation
  • Урок 26. 00:18:34
    Introduction to the STL Vector
  • Урок 27. 00:19:03
    Partial Sums
  • Урок 28. 00:12:11
    Range Update Trick
  • Урок 29. 00:12:29
    Maximum Sum Submatrix
  • Урок 30. 00:07:31
    Maximum Sum Submatrix - Implementation
  • Урок 31. 00:08:11
    Maximum size square full of 1's
  • Урок 32. 00:08:06
    Maximum size square full of 1's - Implementation
  • Урок 33. 00:09:35
    Introduction to Binary Search
  • Урок 34. 00:02:18
    Binary Search - Implementation
  • Урок 35. 00:13:17
    Minimum Capacity Transportation Problem
  • Урок 36. 00:07:40
    Minimum Capacity Transportation - Implementation
  • Урок 37. 00:13:38
    Maximum Number of Groups Problem
  • Урок 38. 00:01:57
    Maximum Number of Groups - Implementation
  • Урок 39. 00:12:59
    Maximum Special Distance Problem
  • Урок 40. 00:04:40
    Maximum Special Distance - Implementation
  • Урок 41. 00:06:12
    Introduction to Recursion
  • Урок 42. 00:12:43
    Fill Algorithm
  • Урок 43. 00:15:01
    Fill Algorithm - Implementation
  • Урок 44. 00:07:45
    Merge Sort - Sorting Algorithm
  • Урок 45. 00:08:22
    Merge Sort - Merging two arrays + Implementation
  • Урок 46. 00:04:48
    Merge Sort - Time Complexity
  • Урок 47. 00:13:36
    Maximum Sum Subarray
  • Урок 48. 00:13:15
    Z-Traversal Problem
  • Урок 49. 00:05:57
    Z-Traversal - Implementation
  • Урок 50. 00:06:56
    Introduction to Stack
  • Урок 51. 00:06:04
    Valid Parentheses Problem
  • Урок 52. 00:04:35
    Valid Parentheses - Implementation
  • Урок 53. 00:09:17
    First Greater Element Problem
  • Урок 54. 00:04:54
    First Greater Element - Implementation
  • Урок 55. 00:09:32
    Largest Rectangular Area in a Histogram
  • Урок 56. 00:04:56
    Largest Rectangular Area in a Histogram - Implementation
  • Урок 57. 00:12:53
    Maximum area rectangle full of 1's
  • Урок 58. 00:01:47
    Maximum area rectangle full of 1's - Implementation
  • Урок 59. 00:07:54
    Introduction to Queue
  • Урок 60. 00:09:25
    Lee's Algorithm
  • Урок 61. 00:05:43
    Lee's Algorithm - Implementation
  • Урок 62. 00:05:29
    Introduction to Deque
  • Урок 63. 00:09:21
    Minimum of K-length subarrays
  • Урок 64. 00:02:59
    Minimum of K-length subarrays - Implementation
  • Урок 65. 00:10:51
    Maximum Sum Subarray with length in given range
  • Урок 66. 00:03:39
    Maximum Sum Subarray with length in given range - Implementation
  • Урок 67. 00:09:01
    Introduction to Hash Table
  • Урок 68. 00:06:52
    Hash Table - Implementation
  • Урок 69. 00:08:42
    Unordered_Map
  • Урок 70. 00:09:53
    Unordered_Set
  • Урок 71. 00:07:10
    Number of Pairs of Given Sum
  • Урок 72. 00:08:49
    I won the Loto! Problem
  • Урок 73. 00:05:24
    I won the Loto! - Implementation #1
  • Урок 74. 00:02:56
    I won the Loto! - Implementation #2
  • Урок 75. 00:05:20
    Introduction to Heap
  • Урок 76. 00:04:55
    Inserting a Node
  • Урок 77. 00:05:08
    Removing the Root
  • Урок 78. 00:02:53
    Time Complexity
  • Урок 79. 00:06:54
    Priority_Queue
  • Урок 80. 00:04:50
    Connect the ropes with minimum cost
  • Урок 81. 00:02:20
    Connect the ropes with minimum cost - Implementation
  • Урок 82. 00:02:17
    Introduction to Greedy
  • Урок 83. 00:09:55
    Knapsack Problem
  • Урок 84. 00:05:03
    Knapsack Problem - Implementation
  • Урок 85. 00:05:01
    Activity Selection Problem
  • Урок 86. 00:02:27
    Activity Selection - Implementation
  • Урок 87. 00:06:13
    Minimum Number of Platforms Problem
  • Урок 88. 00:04:43
    Minimum Number of Platforms - Implementation
  • Урок 89. 00:13:53
    Kill the monsters!
  • Урок 90. 00:05:27
    Kill the monsters! - Implementation
  • Урок 91. 00:12:24
    Minimum Number of Boats Problem
  • Урок 92. 00:06:15
    Minimum Number of Boats - Implementation
  • Урок 93. 00:05:18
    Introduction to Dynamic Programming
  • Урок 94. 00:05:18
    Bulletproof Formula for Every Dynamic Programming Problem
  • Урок 95. 00:10:09
    Longest Increasing Subsequence - Brute Force Approach
  • Урок 96. 00:11:09
    Longest Increasing Subsequence - Optimal Approach
  • Урок 97. 00:04:50
    Longest Increasing Subsequence - Implementation
  • Урок 98. 00:11:35
    Longest Common Subsequence
  • Урок 99. 00:11:16
    Longest Common Subsequence - Building the Solution
  • Урок 100. 00:08:00
    0/1 Knapsack Problem
  • Урок 101. 00:02:18
    0/1 Knapsack Problem - Implementation
  • Урок 102. 00:16:55
    Minimum Edit Distance
  • Урок 103. 00:02:29
    Minimum Edit Distance - Implementation
  • Урок 104. 00:24:06
    132 Pattern
  • Урок 105. 00:05:15
    Two Sum
  • Урок 106. 00:13:00
    Burst Balloons
  • Урок 107. 00:14:48
    Smallest K Integers
  • Урок 108. 00:26:36
    DZY Loves Sequences
  • Урок 109. 00:25:23
    Consecutive Subsequence