Этот материал находится в платной подписке. Оформи премиум подписку и смотри или слушай Competitive Programming Essentials, Master Algorithms, а также все другие курсы, прямо сейчас!
Купить сейчас
  • Урок 1. 00:06:19
    Introduction
  • Урок 2. 00:09:47
    Sublime Setup
  • Урок 3. 00:03:15
    Adding Master Header File
  • Урок 4. 00:06:48
    Escaping Online Judges
  • Урок 5. 00:04:54
    Common Code Snippets
  • Урок 6. 00:09:51
    Using Macros
  • Урок 7. 00:18:06
    Example Code Explained
  • Урок 8. 00:07:41
    Space Time Complexity Introduction
  • Урок 9. 00:09:20
    Experimental Analysis
  • Урок 10. 00:04:37
    Big O Notation
  • Урок 11. 00:02:35
    Nested Loops
  • Урок 12. 00:02:50
    Nested Loops - II
  • Урок 13. 00:03:43
    Analysis of Bubble Sort
  • Урок 14. 00:07:27
    Analayis of BInary Search
  • Урок 15. 00:05:48
    Analysis of Merge Sort
  • Урок 16. 00:03:27
    Avoiding TLE Errors
  • Урок 17. 00:03:28
    Complexities for Worst Case AC
  • Урок 18. 00:14:11
    Data Structures & STL Containers Revisited
  • Урок 19. 00:12:04
    Arrays in C++
  • Урок 20. 00:14:38
    Array STL
  • Урок 21. 00:17:48
    Vector STL
  • Урок 22. 00:07:03
    Deque STL
  • Урок 23. 00:03:08
    Stack STL
  • Урок 24. 00:01:30
    Queue STL
  • Урок 25. 00:05:22
    Priority Queue STL
  • Урок 26. 00:09:55
    Bitwise Operators
  • Урок 27. 00:04:22
    Left Shift & Right Shift
  • Урок 28. 00:03:17
    Odd Even
  • Урок 29. 00:03:56
    Get ith Bit
  • Урок 30. 00:02:43
    Clear ith Bit
  • Урок 31. 00:02:31
    Set ith Bit
  • Урок 32. 00:04:49
    Update ith Bit
  • Урок 33. 00:03:55
    Clear Last i Bits
  • Урок 34. 00:06:10
    Clear Range of Bits
  • Урок 35. 00:04:58
    Replace Bits
  • Урок 36. 00:02:53
    Two Power
  • Урок 37. 00:04:19
    Count Bits
  • Урок 38. 00:03:16
    Count Bits Hack
  • Урок 39. 00:04:14
    Make it Binary
  • Урок 40. 00:06:28
    Unique Number - I
  • Урок 41. 00:01:55
    Unique Number - I Code
  • Урок 42. 00:09:24
    Unique Number - II
  • Урок 43. 00:08:18
    Unique Number - II Code
  • Урок 44. 00:06:11
    Unique Number - III
  • Урок 45. 00:09:15
    Unique Number - III Code
  • Урок 46. 00:06:15
    Finding Subsets
  • Урок 47. 00:05:07
    Finding Subsets Code
  • Урок 48. 00:12:04
    Travelling Salesman Problem
  • Урок 49. 00:03:42
    Travelling Salesman Intution
  • Урок 50. 00:12:26
    Travelling Salesman Code
  • Урок 51. 00:02:44
    Travelling Salesman - DP Optimisation
  • Урок 52. 00:04:46
    Introduction to Big Integers
  • Урок 53. 00:08:55
    Big Addition Concept
  • Урок 54. 00:13:50
    Big Addition Code
  • Урок 55. 00:07:42
    Array & Integer Multiplication
  • Урок 56. 00:09:21
    Large Factorials
  • Урок 57. 00:15:10
    Java Big Integer Class
  • Урок 58. 00:03:45
    BigInteger Example
  • Урок 59. 00:05:06
    Big Integers in Python
  • Урок 60. 00:05:29
    Big Integer Challenge - Julka
  • Урок 61. 00:06:19
    Big Integer Challenge Solution
  • Урок 62. 00:15:01
    Binary Exponentiation
  • Урок 63. 00:09:03
    Modular Binary Exponentiation
  • Урок 64. 00:10:46
    Fast Mutiplication
  • Урок 65. 00:15:55
    Matrix Exponentiation Introduction
  • Урок 66. 00:14:24
    Matrix Exponentiation Code
  • Урок 67. 00:07:29
    Fibosum (spoj)
  • Урок 68. 00:11:04
    Fibosum(second approach)
  • Урок 69. 00:03:05
    Pigeonhole Principle
  • Урок 70. 00:09:05
    Problem DIVSUB
  • Урок 71. 00:11:42
    Applying Pigeonhole Principle
  • Урок 72. 00:12:01
    Gray Similar Code
  • Урок 73. 00:24:07
    Holiday
  • Урок 74. 00:15:26
    Holiday Code
  • Урок 75. 00:08:02
    Expectation
  • Урок 76. 00:03:36
    Linearity of Expectation
  • Урок 77. 00:02:28
    Problem - Linearity of Expectation
  • Урок 78. 00:03:06
    Expected Throws - One Head
  • Урок 79. 00:03:33
    Expected Throws - Two Consecutive Heads
  • Урок 80. 00:05:53
    Expected Throws - N Consecutive Heads
  • Урок 81. 00:03:49
    Bernaulli's Trial
  • Урок 82. 00:01:07
    Choose Number
  • Урок 83. 00:02:04
    Bernoulli's Trial
  • Урок 84. 00:06:44
    Coupon Collector
  • Урок 85. 00:05:34
    Inclusion Exclusion
  • Урок 86. 00:07:12
    Generalised Function
  • Урок 87. 00:14:52
    Problems
  • Урок 88. 00:12:03
    Total Number of Divisors Till N code
  • Урок 89. 00:10:14
    Introduction
  • Урок 90. 00:11:56
    Prime Sieve
  • Урок 91. 00:11:07
    Sieve of Eratosthenes Code
  • Урок 92. 00:06:47
    Prime Queries
  • Урок 93. 00:05:34
    Prime Factorisation
  • Урок 94. 00:03:04
    Prime Factorisation Code O(N)
  • Урок 95. 00:06:39
    Prime Factorisation Code O(Sqrt(N))
  • Урок 96. 00:06:27
    Prime Factorisation using Sieve O(LogN)
  • Урок 97. 00:03:19
    Segmented Sieve
  • Урок 98. 00:08:02
    Segmented Sieve Algorithm
  • Урок 99. 00:14:29
    Segmented Sieve Code
  • Урок 100. 00:06:53
    GCD
  • Урок 101. 00:03:02
    Euclid's Algorithm Code
  • Урок 102. 00:05:54
    GCD Complexity
  • Урок 103. 00:07:46
    Extended Euclideans
  • Урок 104. 00:10:01
    Extended Euclidean Example
  • Урок 105. 00:07:42
    Extended Euclidean Code
  • Урок 106. 00:03:41
    GCD using Extended Euclidean Algorithm
  • Урок 107. 00:04:13
    Multiplicative Modulo Inverse
  • Урок 108. 00:03:45
    Computing Multiplicative Modulo Inverse
  • Урок 109. 00:04:05
    MMI Code
  • Урок 110. 00:09:16
    Linear Diophantine Equations
  • Урок 111. 00:03:04
    Linear Diophantine Equation - Family of Solutions
  • Урок 112. 00:12:28
    Modulo Airthmetic
  • Урок 113. 00:11:49
    Modulo Arithmetic Code
  • Урок 114. 00:09:49
    Fermat's Theorem
  • Урок 115. 00:03:16
    Factorial % P
  • Урок 116. 00:08:30
    nCr % P
  • Урок 117. 00:09:00
    Chinese Remainder Theorem
  • Урок 118. 00:05:17
    Totient Function
  • Урок 119. 00:09:40
    Totient Function code using Seive
  • Урок 120. 00:13:26
    Combinatorics Introduction
  • Урок 121. 00:09:47
    Binomial Coefficients
  • Урок 122. 00:08:50
    Computing Binomial Coefficients
  • Урок 123. 00:08:46
    Birthday Paradox
  • Урок 124. 00:07:49
    Birthday Paradox Code
  • Урок 125. 00:08:24
    Catalan Numbers
  • Урок 126. 00:03:11
    Catalan Numbers Code - Recursive
  • Урок 127. 00:04:14
    Catalan Numbers Code - Iterative / DP
  • Урок 128. 00:10:23
    Recursion Basics
  • Урок 129. 00:07:50
    Factorial
  • Урок 130. 00:11:03
    Fibonacci Series
  • Урок 131. 00:09:51
    Sorted Array Check
  • Урок 132. 00:07:25
    Understanding Recursion DIrections
  • Урок 133. 00:03:38
    Power Function
  • Урок 134. 00:04:54
    Fast Power
  • Урок 135. 00:06:47
    Tiling Problem
  • Урок 136. 00:07:13
    Count Strings
  • Урок 137. 00:06:12
    Friend's Pairing Problem
  • Урок 138. 00:23:55
    Tower Of Hanoi
  • Урок 139. 00:10:08
    Tower Of Hanoi (code)
  • Урок 140. 00:04:28
    Backtracking Problems
  • Урок 141. 00:13:04
    Finding Subsets
  • Урок 142. 00:07:29
    Finding Subsets Code
  • Урок 143. 00:10:52
    Permuations
  • Урок 144. 00:06:56
    Brackets
  • Урок 145. 00:06:51
    Brackets Code
  • Урок 146. 00:11:54
    N-Queen
  • Урок 147. 00:15:59
    N-Queen Code
  • Урок 148. 00:14:58
    N-Queen Ways
  • Урок 149. 00:10:41
    Sudoku Solver
  • Урок 150. 00:18:30
    Sudoku Solver Code
  • Урок 151. 00:08:01
    Binary Search
  • Урок 152. 00:04:07
    Binary Search Code
  • Урок 153. 00:07:08
    Lower Bound and Upper Bound
  • Урок 154. 00:03:05
    Lower Bound Code
  • Урок 155. 00:11:22
    Angry Birds
  • Урок 156. 00:10:02
    Angry Bird Code
  • Урок 157. 00:08:21
    Game of Greed
  • Урок 158. 00:10:03
    Game of Greed Code
  • Урок 159. 00:04:29
    Merge Sort
  • Урок 160. 00:12:42
    Merge Sort Code
  • Урок 161. 00:10:12
    Quick Sort
  • Урок 162. 00:10:12
    Quick Sort Code
  • Урок 163. 00:04:34
    Quick Select
  • Урок 164. 00:03:05
    Quick Select Code
  • Урок 165. 00:13:46
    Inversion Count
  • Урок 166. 00:04:06
    Inversion Count Code
  • Урок 167. 00:15:13
    Ternary Search
  • Урок 168. 00:06:54
    Ternary Search - Finding maxima/minima of a parabola (Code)
  • Урок 169. 00:04:37
    Greedy Introduction
  • Урок 170. 00:04:49
    Indian Coin Change
  • Урок 171. 00:06:00
    Greedy vs DP
  • Урок 172. 00:09:57
    Activity Selection / Busyman
  • Урок 173. 00:07:04
    Baised Standings
  • Урок 174. 00:13:09
    Kingdom Defense
  • Урок 175. 00:21:31
    Introduction
  • Урок 176. 00:06:45
    Subsums Code
  • Урок 177. 00:11:33
    Introduction and Structure
  • Урок 178. 00:05:27
    Building
  • Урок 179. 00:18:29
    Query
  • Урок 180. 00:08:49
    Update
  • Урок 181. 00:10:32
    Facts and Properties
  • Урок 182. 00:26:24
    Code
  • Урок 183. 00:11:26
    Introduction
  • Урок 184. 00:15:03
    Algorithm
  • Урок 185. 00:12:50
    Code
  • Урок 186. 00:03:21
    Bug and Code Continued
  • Урок 187. 00:11:50
    Structure
  • Урок 188. 00:13:34
    Query
  • Урок 189. 00:11:09
    Update
  • Урок 190. 00:12:21
    Code
  • Урок 191. 00:07:13
    Inversion Count (Multiple Ways of solving it)
  • Урок 192. 00:11:29
    Inversion Count Using Fenwick Tree
  • Урок 193. 00:05:42
    Inversion Count Using Fenwick Tree Code
  • Урок 194. 00:11:55
    Sqrt Decomposition Introduction
  • Урок 195. 00:09:59
    Range queries (Code)
  • Урок 196. 00:11:27
    DQUERY SPOJ using Mo's Algorithm
  • Урок 197. 00:09:46
    Sorting the queries according to MO's comparator
  • Урок 198. 00:15:12
    4 Pointers Technique
  • Урок 199. 00:20:02
    Code and Complexity of MO's Algorithm
  • Урок 200. 00:16:51
    DQUERY using Fenwick Tree
  • Урок 201. 00:08:17
    Combinatorial Games
  • Урок 202. 00:16:32
    Take Away Games
  • Урок 203. 00:09:30
    N and P positions
  • Урок 204. 00:09:47
    Game of Nim
  • Урок 205. 00:06:05
    Nim Sum
  • Урок 206. 00:24:57
    Applications of Nim Sum
  • Урок 207. 00:16:51
    Examples of Nim Games
  • Урок 208. 00:12:05
    Introduction
  • Урок 209. 00:09:08
    Graph Key Concepts
  • Урок 210. 00:08:43
    Adjacency List
  • Урок 211. 00:09:09
    Adjacency List 2
  • Урок 212. 00:06:44
    BFS Concept
  • Урок 213. 00:07:16
    BFS
  • Урок 214. 00:04:19
    DFS
  • Урок 215. 00:05:41
    DFS Code
  • Урок 216. 00:04:31
    Shortest Path
  • Урок 217. 00:06:11
    Shortest Path Code
  • Урок 218. 00:12:12
    Board Game
  • Урок 219. 00:19:31
    Board Game Code
  • Урок 220. 00:24:27
    Trees
  • Урок 221. 00:08:03
    DFS on Trees
  • Урок 222. 00:09:07
    DFS Trees and Backedges
  • Урок 223. 00:16:41
    DFS Tree and Backedges Code
  • Урок 224. 00:12:37
    LCA introduction
  • Урок 225. 00:16:12
    LCA Brute Force
  • Урок 226. 00:38:43
    LCA using Binary Lifting
  • Урок 227. 00:18:42
    Intro
  • Урок 228. 00:20:42
    Topological Sort
  • Урок 229. 00:09:51
    SCC Theory
  • Урок 230. 00:12:51
    Condensed Component Graph
  • Урок 231. 00:11:47
    Kosaraju Algorithm Code
  • Урок 232. 00:30:06
    Kosaraju Algorithm for Strongly Connected Component
  • Урок 233. 00:04:20
    DSU Introduction
  • Урок 234. 00:09:02
    DSU Data Structure
  • Урок 235. 00:07:03
    Union & Find Ops
  • Урок 236. 00:13:17
    DSU Implementation
  • Урок 237. 00:10:16
    Union By Rank
  • Урок 238. 00:08:39
    Path Compression
  • Урок 239. 00:13:15
    Dry Run
  • Урок 240. 00:19:33
    Prim's Algorithm
  • Урок 241. 00:18:43
    Prim's Code
  • Урок 242. 00:08:59
    Kruskal's Algorithm
  • Урок 243. 00:13:38
    Kruskal's Code
  • Урок 244. 00:07:53
    Shortest Path Introduction
  • Урок 245. 00:09:12
    Dijkstra's Algorithm
  • Урок 246. 00:14:54
    Dijkstra's Algorithm Code
  • Урок 247. 00:33:09
    Bellman Ford Algorithm
  • Урок 248. 00:09:11
    Bellman Ford Code
  • Урок 249. 00:29:35
    Floyd Warshall Algorithm
  • Урок 250. 00:08:38
    Floyd Warshall Code
  • Урок 251. 00:16:50
    Introduction to Dynamic Programming
  • Урок 252. 00:05:05
    A Note About DP
  • Урок 253. 00:12:48
    N-K Ladders
  • Урок 254. 00:04:11
    N-K Ladders Top Down
  • Урок 255. 00:08:08
    N-K Ladders Bottom Up
  • Урок 256. 00:07:28
    Minimum Jums
  • Урок 257. 00:05:55
    Minimum Jumps Code
  • Урок 258. 00:06:47
    Longest Increasing Subsequence
  • Урок 259. 00:02:45
    Longest Increasing Subsequence Code
  • Урок 260. 00:10:27
    Box Stacking Problem
  • Урок 261. 00:09:45
    Box Stacking Code
  • Урок 262. 00:14:46
    Terms and Definitions
  • Урок 263. 00:11:20
    Tabulation vs Memoisation
  • Урок 264. 00:25:28
    Frogs - 1
  • Урок 265. 00:25:30
    Frogs - 2
  • Урок 266. 00:21:51
    Vacation
  • Урок 267. 00:26:03
    Knapsack 1
  • Урок 268. 00:40:54
    Knapsack 2
  • Урок 269. 00:26:42
    LCS
  • Урок 270. 00:21:47
    LCS (code)
  • Урок 271. 00:09:10
    Longest Path
  • Урок 272. 00:07:43
    Longest Path (code)
  • Урок 273. 00:09:21
    Grid 1
  • Урок 274. 00:04:11
    Grid 1 (code)
  • Урок 275. 00:07:50
    Coins
  • Урок 276. 00:13:15
    Coins (code)
  • Урок 277. 00:15:22
    Sushi
  • Урок 278. 00:13:49
    Sushi (code)
  • Урок 279. 00:13:31
    Stones
  • Урок 280. 00:31:36
    Deque (first solution)
  • Урок 281. 00:10:44
    Deque (second solution)
  • Урок 282. 00:27:03
    Candies
  • Урок 283. 00:09:58
    Candies (code)
  • Урок 284. 00:13:14
    Slimes
  • Урок 285. 00:18:04
    Slimes (code)
  • Урок 286. 00:08:12
    Matching
  • Урок 287. 00:05:39
    Matching continued...
  • Урок 288. 00:20:19
    Matching (code)
  • Урок 289. 00:22:44
    Independent Set
  • Урок 290. 00:09:18
    Independent Set (code)
  • Урок 291. 00:18:28
    Flowers
  • Урок 292. 00:05:43
    Flowers using segment tree
  • Урок 293. 00:19:53
    Flowers (code)
  • Урок 294. 00:16:54
    Walk
  • Урок 295. 00:05:44
    Walk (code)
  • Урок 296. 00:17:41
    Digit Sum
  • Урок 297. 00:18:24
    Digit Sum (code)
  • Урок 298. 00:25:15
    Permutation
  • Урок 299. 00:17:22
    Permutation (Brute Force)
  • Урок 300. 00:17:54
    Permutation (code)
  • Урок 301. 00:11:00
    Brute Force Pattern Matching using STL
  • Урок 302. 00:30:58
    Trie
  • Урок 303. 00:13:15
    Pattern Matching using Trie
  • Урок 304. 00:13:52
    String Hashing - Polynomial Hash Function
  • Урок 305. 00:04:49
    Polynomial Hash Code
  • Урок 306. 00:09:27
    Rolling Hash / Rabin Karp Algorithm
  • Урок 307. 00:12:30
    Rabin Karp algorithm Code
  • Урок 308. 00:07:12
    Introduction
  • Урок 309. 00:07:22
    Orientation of Points
  • Урок 310. 00:20:49
    Graham's Scan algorithm
  • Урок 311. 00:23:58
    Graham's Scan Algorithm Code
  • Урок 312. 00:06:58
    Problem - Polygon (Codeforces)
  • Урок 313. 00:21:20
    Introduction
  • Урок 314. 00:13:01
    Codeforces - Guess the Number
  • Урок 315. 00:06:46
    Guess the Number - code
  • Урок 316. 00:10:41
    Lost Numbers
  • Урок 317. 00:08:35
    Lost Numbers (code)
  • Урок 318. 00:09:39
    Xor Guessing
  • Урок 319. 00:04:49
    Xor Guessing (code)
  • Урок 320. 00:09:57
    Randomised Random Function
  • Урок 321. 00:07:56
    Run Code for a Particular Time
  • Урок 322. 00:08:30
    Introduction & Applications
  • Урок 323. 00:13:17
    Structure and Working
  • Урок 324. 00:08:40
    Using Coding Minutes IDE
  • Урок 325. 00:14:28
    Inversion Count using PBDS
  • Урок 326. 00:14:28
    Getting started with Codeforces / Spoj
  • Урок 327. 00:07:10
    Where to practice?