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

  1. Урок 1. 00:05:24
    Course Orientation!
  2. Урок 2. 00:02:59
    How to do this course?
  3. Урок 3. 00:04:18
    Introduction
  4. Урок 4. 00:05:25
    Vector STL - Demo
  5. Урок 5. 00:03:05
    Vector of Vector - Demo
  6. Урок 6. 00:05:05
    How to submit coding exercises?
  7. Урок 7. 00:09:41
    Pairs
  8. Урок 8. 00:04:15
    Pairs Code
  9. Урок 9. 00:08:33
    Triplets
  10. Урок 10. 00:06:47
    Triplets Code
  11. Урок 11. 00:07:28
    Mountain
  12. Урок 12. 00:07:33
    Mountain Code
  13. Урок 13. 00:10:51
    Longest Band
  14. Урок 14. 00:07:19
    Longest Band Code
  15. Урок 15. 00:10:19
    Rains
  16. Урок 16. 00:06:56
    Rains Code
  17. Урок 17. 00:10:25
    Subarray Sort
  18. Урок 18. 00:08:23
    Subarray Sort Code
  19. Урок 19. 00:09:19
    Minimum Swaps
  20. Урок 20. 00:13:13
    Minimum Swaps Code
  21. Урок 21. 00:06:13
    Strings Introduction
  22. Урок 22. 00:05:16
    Searching Inside String!
  23. Урок 23. 00:03:19
    Space20
  24. Урок 24. 00:06:22
    Space20 Implementation
  25. Урок 25. 00:04:44
    Tokenisation (using sstream)
  26. Урок 26. 00:04:45
    Tokenisation (using strtok)
  27. Урок 27. 00:08:02
    Designing our own String Tokeniser!
  28. Урок 28. 00:09:08
    String Key Sort
  29. Урок 29. 00:16:14
    String Key Sort Implementation
  30. Урок 30. 00:04:10
    Check Subsets
  31. Урок 31. 00:02:35
    Check Subsets Implementation
  32. Урок 32. 00:05:12
    Sort Subsequences
  33. Урок 33. 00:05:14
    Sort Subsequences Code
  34. Урок 34. 00:02:51
    Sliding Window Introduction
  35. Урок 35. 00:12:28
    Housing (Two Pointer)
  36. Урок 36. 00:07:42
    Housing Implementation
  37. Урок 37. 00:09:21
    Unique Substring (Hashing)
  38. Урок 38. 00:12:26
    Unique Substring Implementation
  39. Урок 39. 00:08:48
    String Window
  40. Урок 40. 00:15:35
    String Window Implementation
  41. Урок 41. 00:04:29
    Merge Sort
  42. Урок 42. 00:12:42
    Merge Sort Code
  43. Урок 43. 00:13:46
    Inversion Count
  44. Урок 44. 00:04:06
    Inversion Count Code
  45. Урок 45. 00:10:12
    Quick Sort
  46. Урок 46. 00:06:28
    Quick Sort Code
  47. Урок 47. 00:04:34
    Quick Select
  48. Урок 48. 00:03:05
    Quick Select Code
  49. Урок 49. 00:06:43
    Smallest String
  50. Урок 50. 00:01:10
    Smallest String Code
  51. Урок 51. 00:06:23
    Sparse Search
  52. Урок 52. 00:06:34
    Sparse Search Code
  53. Урок 53. 00:03:59
    Binary Search - Recap!
  54. Урок 54. 00:07:09
    Frequency Count
  55. Урок 55. 00:03:06
    Frequency Count Code-I
  56. Урок 56. 00:03:44
    Frequency Count Code-II
  57. Урок 57. 00:08:40
    Rotated Search
  58. Урок 58. 00:06:09
    Rotated Search Code
  59. Урок 59. 00:09:50
    Finding Roots
  60. Урок 60. 00:06:26
    Square Roots Code
  61. Урок 61. 00:11:22
    Angry Birds
  62. Урок 62. 00:10:02
    Angry Birds Code
  63. Урок 63. 00:05:43
    Min Pairs
  64. Урок 64. 00:05:26
    Min Pairs Code
  65. Урок 65. 00:08:21
    Game of Greed Concept
  66. Урок 66. 00:10:04
    Game of Greed Code
  67. Урок 67. 00:05:40
    Recursion Recap
  68. Урок 68. 00:08:03
    Ladders Concept
  69. Урок 69. 00:04:44
    Ladders Code
  70. Урок 70. 00:05:13
    Subsequence Based Problems
  71. Урок 71. 00:06:08
    Subset Sum to X
  72. Урок 72. 00:02:44
    Subset Sum to X Code
  73. Урок 73. 00:06:57
    Generate Brackets
  74. Урок 74. 00:06:51
    Generate Brackets Code
  75. Урок 75. 00:03:45
    Smart Keypad
  76. Урок 76. 00:07:11
    Smart Keypad Code
  77. Урок 77. 00:10:52
    Permutations
  78. Урок 78. 00:11:54
    N-Queen Problem
  79. Урок 79. 00:15:59
    N-Queen Code 1
  80. Урок 80. 00:15:59
    N-Queen Code 2
  81. Урок 81. 00:10:41
    Sudoku
  82. Урок 82. 00:18:30
    Sudoku Code
  83. Урок 83. 00:07:57
    Linked List Section Introduction
  84. Урок 84. 00:07:01
    Warm Up - Creating a Linked List
  85. Урок 85. 00:04:20
    Practice - Insertion in the Middle
  86. Урок 86. 00:06:11
    Recursive Reverse a Linked List
  87. Урок 87. 00:03:04
    Recursively Reverse a Linked List Code
  88. Урок 88. 00:04:44
    Iterative Reverse
  89. Урок 89. 00:02:17
    Iteratively Reverse a Linked List Code
  90. Урок 90. 00:03:50
    K-Reverse a Linked List
  91. Урок 91. 00:06:36
    K-Reverse Code
  92. Урок 92. 00:04:08
    Merge Two Sorted Linked Lists
  93. Урок 93. 00:05:07
    Merge Two Sorted Linked Lists Code
  94. Урок 94. 00:01:33
    Runner Technique
  95. Урок 95. 00:04:37
    Merge Sort on Linked List
  96. Урок 96. 00:05:08
    Merge Sort Linked List Code
  97. Урок 97. 00:06:16
    Stacks, Queue, Deque Recap
  98. Урок 98. 00:04:02
    Balanced Paranthesis
  99. Урок 99. 00:05:58
    Balanced Paranthesis Code
  100. Урок 100. 00:08:39
    Redundant Paranthesis
  101. Урок 101. 00:05:43
    Redundant Paranthesis Code
  102. Урок 102. 00:07:08
    First Non-Repeating Letter
  103. Урок 103. 00:04:34
    First Non-Repeating Code
  104. Урок 104. 00:24:52
    Max Subarray (Sliding Window + Deque)
  105. Урок 105. 00:09:06
    Simplify Path
  106. Урок 106. 00:21:13
    Simplify Path Code
  107. Урок 107. 00:09:05
    Binary Trees Recap
  108. Урок 108. 00:06:24
    Build Tree - Boilerplate Code
  109. Урок 109. 00:09:20
    Level Order Print
  110. Урок 110. 00:06:15
    Level Order Print Code
  111. Урок 111. 00:06:33
    Level Order Build
  112. Урок 112. 00:04:44
    Level Order Build Code
  113. Урок 113. 00:09:15
    Tree Diameter Concept
  114. Урок 114. 00:02:44
    Tree Diameter Code
  115. Урок 115. 00:11:14
    Tree Diameter Optimised Code
  116. Урок 116. 00:07:32
    Replace with Descendant Sum
  117. Урок 117. 00:04:25
    Replace with Descendant Sum Code
  118. Урок 118. 00:03:16
    Height of Tree
  119. Урок 119. 00:07:47
    Height Balanced Tree Concept
  120. Урок 120. 00:06:53
    Height Balanced Tree Code
  121. Урок 121. 00:10:02
    Max Subset Sum Tree
  122. Урок 122. 00:03:29
    Max Subset Sum Tree Code
  123. Урок 123. 00:01:18
    Print At LevelK
  124. Урок 124. 00:15:00
    Nodes at Distance K
  125. Урок 125. 00:09:52
    Nodes at Distance K Code
  126. Урок 126. 00:04:58
    Vertical Order Print
  127. Урок 127. 00:06:47
    Vertical Order Print Code
  128. Урок 128. 00:07:23
    BST Introduction
  129. Урок 129. 00:07:50
    BST Creation Recap
  130. Урок 130. 00:03:36
    Minimum Height BST
  131. Урок 131. 00:02:54
    Closest in BST
  132. Урок 132. 00:04:18
    Closest in BST Code
  133. Урок 133. 00:11:03
    Tree to Linked List
  134. Урок 134. 00:08:04
    Tree 2 Linked List Code
  135. Урок 135. 00:05:36
    Inorder Successor in BST
  136. Урок 136. 00:06:20
    Inorder Successor in BST Code
  137. Урок 137. 00:03:39
    Heaps - Recap!
  138. Урок 138. 00:05:23
    Sorting using Heap!
  139. Урок 139. 00:08:11
    Finding Cabs
  140. Урок 140. 00:11:47
    Finding Cabs Implementation
  141. Урок 141. 00:06:54
    Merging Ropes
  142. Урок 142. 00:02:21
    Merging Ropes Implementation
  143. Урок 143. 00:11:46
    Running Median
  144. Урок 144. 00:06:45
    Running Median Implementation
  145. Урок 145. 00:07:43
    Merging K-Arrays
  146. Урок 146. 00:07:40
    Merge K-Sorted Arrays Code
  147. Урок 147. 00:17:40
    Triplets in GP | Hashing with Slider
  148. Урок 148. 00:06:39
    Triplets in GP Implementation
  149. Урок 149. 00:10:17
    Counting Rectangles | Sets
  150. Урок 150. 00:11:15
    Counting Rectangles Implementation
  151. Урок 151. 00:10:35
    Counting Triangles | Unordered Maps
  152. Урок 152. 00:06:00
    Counting Triangles Implementation
  153. Урок 153. 00:14:40
    Anagrams in Substrings | Maps
  154. Урок 154. 00:08:40
    Anagrams in Substrings Implementation
  155. Урок 155. 00:11:44
    Quick Brown Fox | Hashing with DP
  156. Урок 156. 00:15:42
    Quick Brown Fox Implementation
  157. Урок 157. 00:15:16
    Tries Introduction
  158. Урок 158. 00:12:12
    Prefix Trie Implementation
  159. Урок 159. 00:03:38
    Suffix Trie
  160. Урок 160. 00:04:15
    Suffix Trie Implementation
  161. Урок 161. 00:12:06
    Cute Little Cat (Trie + Hashing)
  162. Урок 162. 00:12:58
    Cute Little Cat Implementation
  163. Урок 163. 00:13:37
    Biggest XOR (Trie + Bitmasks)
  164. Урок 164. 00:14:58
    Biggest XOR Implementation
  165. Урок 165. 00:02:11
    Graphs Section Introduction
  166. Урок 166. 00:05:49
    Graphs 10 Cool Applications
  167. Урок 167. 00:09:08
    Graph Key Terms
  168. Урок 168. 00:08:43
    Adjacency List Representation
  169. Урок 169. 00:09:09
    Adjacency List Representation with Node Class
  170. Урок 170. 00:06:44
    Breadth First Search (BFS)
  171. Урок 171. 00:07:16
    BFS Code
  172. Урок 172. 00:04:31
    Shortest Path using BFS
  173. Урок 173. 00:06:11
    Shortest Path using BFS Code
  174. Урок 174. 00:08:25
    Solution - Snakes & Ladders
  175. Урок 175. 00:04:19
    Depth First Search (DFS)
  176. Урок 176. 00:05:41
    DFS Code
  177. Урок 177. 00:03:35
    Cycle Detection in Undirected Graphs
  178. Урок 178. 00:08:59
    Solution - Cycle Detection in Undirected Graph
  179. Урок 179. 00:08:56
    Backedge Detection
  180. Урок 180. 00:12:47
    Solution - Cycle Detection in Directed Graph
  181. Урок 181. 00:09:12
    Dijkshtra's Algorithm
  182. Урок 182. 00:14:55
    Dijkshtra's Algorithm Code
  183. Урок 183. 00:12:12
    Board Game (Trie+Backtracking+Graph)
  184. Урок 184. 00:19:31
    Board Game Implementation
  185. Урок 185. 00:12:21
    Solution - Shortest Grid Path
  186. Урок 186. 00:12:31
    Solution - Largest Island
  187. Урок 187. 00:06:05
    Solution - Graph Sequence
  188. Урок 188. 00:16:50
    Introduction to Dynamic Programming
  189. Урок 189. 00:05:05
    A Note about DP
  190. Урок 190. 00:12:48
    N-K Ladders (3 Approaches)
  191. Урок 191. 00:04:12
    N-K Ladders Code (Top Down)
  192. Урок 192. 00:08:08
    N-K Ladders Code (Bottom Up)
  193. Урок 193. 00:11:45
    Coin Change
  194. Урок 194. 00:06:51
    Coin Change Code
  195. Урок 195. 00:16:25
    Cutting Rods Solved!
  196. Урок 196. 00:07:28
    Min Array Jumps
  197. Урок 197. 00:05:55
    Min Array Jumps Code
  198. Урок 198. 00:08:02
    Frog's Min Cost-I
  199. Урок 199. 00:02:53
    Frog's Min Cost-I Code
  200. Урок 200. 00:06:35
    Maximum Non Adjacent Sum
  201. Урок 201. 00:04:45
    Maximum Non Adjacent Sum Code
  202. Урок 202. 00:06:47
    Longest Increasing Sequence
  203. Урок 203. 00:02:45
    Longest Increasing Subsequence Code
  204. Урок 204. 00:10:27
    Box Stacking Problem
  205. Урок 205. 00:09:45
    Box Stacking Code
  206. Урок 206. 00:08:24
    Counting Trees
  207. Урок 207. 00:03:11
    Counting Trees Code
  208. Урок 208. 00:04:14
    Counting Trees Bottom Up Code
  209. Урок 209. 00:08:00
    Longest Common Subsequence
  210. Урок 210. 00:11:07
    LCS Top Down
  211. Урок 211. 00:19:32
    LCS Bottom Up & Print
  212. Урок 212. 00:06:33
    Selling Wines
  213. Урок 213. 00:06:22
    Selling Wines - Top Down DP Code
  214. Урок 214. 00:09:13
    Selling Wines - Diagonal Table Filling
  215. Урок 215. 00:07:58
    Selling Wines - Bottom Up DP Code
  216. Урок 216. 00:09:22
    Counting Subsequences
  217. Урок 217. 00:05:19
    Counting Subsequences Recursive
  218. Урок 218. 00:07:39
    Counting Subsequences - Table Filling
  219. Урок 219. 00:04:40
    Counting Subsequences - Bottom Up
  220. Урок 220. 00:11:12
    Knapsack Problem
  221. Урок 221. 00:03:39
    Knapsack Problem Recursive
  222. Урок 222. 00:08:47
    Knapsack Problem Bottom Up
  223. Урок 223. 00:07:40
    LRU Cache Introduction
  224. Урок 224. 00:08:19
    LRU Data Structure
  225. Урок 225. 00:04:35
    LRU Code-I
  226. Урок 226. 00:04:31
    LRU Code - II
  227. Урок 227. 00:03:58
    LRU Code - III
  228. Урок 228. 00:04:36
    LRU Code - IV