-
Урок 1.
00:02:00
Introduction
-
Урок 2.
00:09:47
Sublime Setup
-
Урок 3.
00:03:15
Add 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
-
Урок 8.
00:10:23
Recursion Introduction
-
Урок 9.
00:07:50
Factorial
-
Урок 10.
00:11:03
Fibonacci
-
Урок 11.
00:09:51
Sorted Array
-
Урок 12.
00:07:25
Increasing Decreasing Number
-
Урок 13.
00:03:38
Power Function
-
Урок 14.
00:04:54
Power Function Fast
-
Урок 15.
00:06:47
Tiling Problem
-
Урок 16.
00:07:13
Count Strings
-
Урок 17.
00:06:12
Friends Pairing Problem
-
Урок 18.
00:23:55
Tower Of Hanoi
-
Урок 19.
00:10:08
Tower Of Hanoi (code)
-
Урок 20.
00:04:28
Backtracking Introduction
-
Урок 21.
00:13:05
Finding Subsets
-
Урок 22.
00:07:29
Finding Subsets Code
-
Урок 23.
00:11:54
N-Queen
-
Урок 24.
00:15:59
N-Queen Backtracking Code
-
Урок 25.
00:14:58
N-Queen Count Ways
-
Урок 26.
00:06:57
Generate Brackets
-
Урок 27.
00:06:51
Generate Brackets Code
-
Урок 28.
00:10:41
Sudoku Solver
-
Урок 29.
00:18:30
Suodoku Code
-
Урок 30.
00:08:22
Hamiltonian Paths Backtracking
-
Урок 31.
00:04:40
Hamiltonian Paths Backtracking (code)
-
Урок 32.
00:14:46
Terms and Definitions
-
Урок 33.
00:11:20
Tabulation vs Memoisation
-
Урок 34.
00:21:38
Recursion is Everywhere - I
-
Урок 35.
00:11:40
Recursion is Everywhere - II
-
Урок 36.
00:01:25
Big TIP
-
Урок 37.
00:04:55
Introduction
-
Урок 38.
00:31:52
SUPW (Zonal Computing Olympiad)
-
Урок 39.
00:05:16
SUPW (code)
-
Урок 40.
00:04:11
IPL
-
Урок 41.
00:11:27
Min steps to reach one
-
Урок 42.
00:12:38
Alphacode
-
Урок 43.
00:10:31
Alphacode (code)
-
Урок 44.
00:11:56
Rod Cutting
-
Урок 45.
00:07:21
Rod Cutting (code)
-
Урок 46.
00:13:10
House Robber
-
Урок 47.
00:24:09
Palindromic Partioning
-
Урок 48.
00:17:49
Subset Sum (problem)
-
Урок 49.
00:12:29
Subset sum (code)
-
Урок 50.
00:11:55
Subset Sum with Repeating Numbers
-
Урок 51.
00:03:53
Subset Sum Repeating Numbers (code)
-
Урок 52.
00:09:42
Subset Sum (Tabulation)
-
Урок 53.
00:09:49
Subset Sum Tabulation (code)
-
Урок 54.
00:12:16
Memory Optimisation - Subset Sum
-
Урок 55.
00:09:12
Memory Super Optimisation - Subset Sum
-
Урок 56.
00:05:34
Tracing Back Solutions
-
Урок 57.
00:19:20
Modulo Sum (codeforces)
-
Урок 58.
00:11:49
Introduction and greedy approaches
-
Урок 59.
00:11:22
0/1 Knapsack
-
Урок 60.
00:07:16
Knapsack (code)
-
Урок 61.
00:06:28
0/N Knapsack
-
Урок 62.
00:18:19
Colourful Knapsack
-
Урок 63.
00:11:15
Paint House
-
Урок 64.
00:05:48
Paint House (code)
-
Урок 65.
00:06:16
Paint House(follow up)
-
Урок 66.
00:16:58
Make Fence Great Again (codeforces)
-
Урок 67.
00:21:26
Plates
-
Урок 68.
00:08:27
Plates (code)
-
Урок 69.
00:14:03
Best Time to Buy and Sell Stock
-
Урок 70.
00:06:23
Best Time to Buy and Sell Stock (code)
-
Урок 71.
00:09:59
Partition Array for Maximum Sum
-
Урок 72.
00:01:33
Partition Equal Sum Subset
-
Урок 73.
00:14:32
Split Array largest Sum
-
Урок 74.
00:06:59
Split Array Largest Sum (code)
-
Урок 75.
00:05:39
Palindromic Partitioning 2
-
Урок 76.
00:10:34
Palindromic Partitioning 2 (code)
-
Урок 77.
00:08:39
Tiling Problem - 1
-
Урок 78.
00:03:10
Tiling Problem - 2
-
Урок 79.
00:13:33
Tiling problem - 3
-
Урок 80.
00:03:43
Tiling Problem - 3 (code)
-
Урок 81.
00:16:58
Advance Tiling problem (SPOJ - M3TILE) with code
-
Урок 82.
00:02:18
Number of jumps to reach n
-
Урок 83.
00:16:33
Binomial Coefficients
-
Урок 84.
00:06:57
Friends pairing Problem
-
Урок 85.
00:09:22
Partition N into positive integers
-
Урок 86.
00:12:57
Ordered Pair (code)
-
Урок 87.
00:17:30
Unordered Pair (code)
-
Урок 88.
00:30:46
Solved! Unordered Pair (another recurrence relation)
-
Урок 89.
00:14:58
Longest Increasing Sequences
-
Урок 90.
00:08:29
Longest Increasing Sequence (code)
-
Урок 91.
00:20:56
Good Sequences
-
Урок 92.
00:11:20
Good Sequences (code)
-
Урок 93.
00:08:11
Consecutive Sequences
-
Урок 94.
00:04:20
Consecutive Sequences (code)
-
Урок 95.
00:01:58
Multi - Dimensional DP
-
Урок 96.
00:12:26
Introduction
-
Урок 97.
00:10:37
Recursive Code
-
Урок 98.
00:07:40
Sum Of Digits
-
Урок 99.
00:32:22
Investigation + Code
-
Урок 100.
00:08:00
Tricks involved
-
Урок 101.
00:00:25
Typo! sorry
-
Урок 102.
00:07:23
Magic Number (codeforces)
-
Урок 103.
00:15:56
Magic Number (code)
-
Урок 104.
00:00:27
Nit pick
-
Урок 105.
00:05:16
Introduction
-
Урок 106.
00:08:36
Vertex Cover (greedy)
-
Урок 107.
00:08:12
Definitions and Rules
-
Урок 108.
00:14:14
Vertex Cover DP
-
Урок 109.
00:10:07
DP code (Recursion + Memoisation)
-
Урок 110.
00:05:33
DP on trees using DFS
-
Урок 111.
00:07:43
DP on trees using BFS
-
Урок 112.
00:14:51
Tree Diameter (cses)
-
Урок 113.
00:09:08
Tree Diameter (code)
-
Урок 114.
00:01:22
Tree Diameter (NitPick)
-
Урок 115.
00:21:57
Distance Tree 1 (CSES)
-
Урок 116.
00:15:57
Distance Tree 1 (code)
-
Урок 117.
00:17:04
Tree Distance 2
-
Урок 118.
00:07:00
Tree Distance 2 (code)
-
Урок 119.
00:08:29
Company Queries 1
-
Урок 120.
00:12:46
Binary Lifting using Dynamic Programming
-
Урок 121.
00:12:31
Company Queries 1(code)
-
Урок 122.
00:38:43
LCA
-
Урок 123.
00:03:13
Intro
-
Урок 124.
00:09:07
DFS Tree and Backedges
-
Урок 125.
00:16:41
DFS Tree and Backedges (code)
-
Урок 126.
00:23:12
DFS Trees and Backedges in Directed Graphs
-
Урок 127.
00:12:27
Intro to Articulation Points and Bridges
-
Урок 128.
00:11:33
DP - Discovery Time
-
Урок 129.
00:24:48
Lowest Time
-
Урок 130.
00:19:20
Articulation Point and Bridges concept
-
Урок 131.
00:17:18
Articulation Point and Bridges(code)
-
Урок 132.
00:25:36
Edit Distance
-
Урок 133.
00:05:55
Edit Distance code (top-down)
-
Урок 134.
00:07:43
Edit distance (bottom up)
-
Урок 135.
00:15:06
Longest Common Subsequence
-
Урок 136.
00:03:58
Longest Common Substring
-
Урок 137.
00:23:07
Wildcard Pattern Matching
-
Урок 138.
00:15:16
Wildcard Pattern Matching (code)
-
Урок 139.
00:20:57
Regular Expression Matching
-
Урок 140.
00:07:44
Regular Expression Matching Code
-
Урок 141.
00:11:48
Interleaving Strings
-
Урок 142.
00:06:15
Interleaving Strings (code)
-
Урок 143.
00:04:51
Palindromic Substrings
-
Урок 144.
00:05:16
Longest Palindromic Subsequences
-
Урок 145.
00:13:49
Bit Manipulation Basics
-
Урок 146.
00:06:45
Hamiltonian Paths
-
Урок 147.
00:13:26
Hamiltonian Paths - Recursion + Memoisation Code
-
Урок 148.
00:07:02
Changing Iteration over permutations to iteration over subsets
-
Урок 149.
00:02:36
Binary masking factorials
-
Урок 150.
00:05:21
Bitmask For Optimisations
-
Урок 151.
00:06:38
Bitmask For Optimisations (Code)
-
Урок 152.
00:09:22
Dp Bitmasking Bottom Up Code
-
Урок 153.
00:20:54
Optimal Selection
-
Урок 154.
00:09:08
Optimal Selection code
-
Урок 155.
00:16:29
Elevator Problem
-
Урок 156.
00:09:50
Elevator Problem (code)
-
Урок 157.
00:08:47
Intro
-
Урок 158.
00:07:59
Code
-
Урок 159.
00:15:01
Binary Exponentiation
-
Урок 160.
00:09:03
Modular Exponentiation
-
Урок 161.
00:10:46
Fast Multiplication
-
Урок 162.
00:15:55
Matrix Exponentiation
-
Урок 163.
00:14:24
Matrix Exponentiation Code
-
Урок 164.
00:07:29
Fibosum (spoj) first approach
-
Урок 165.
00:11:05
Fibosum (spoj) second approach
-
Урок 166.
00:08:17
Combinatorial Games
-
Урок 167.
00:14:23
Game Theory Problems using DP
-
Урок 168.
00:05:32
Mesere Rule
-
Урок 169.
00:05:32
Examples
-
Урок 170.
00:09:30
N/P Positions
-
Урок 171.
00:06:50
Chessboard Game
-
Урок 172.
00:21:03
Stone Division
-
Урок 173.
00:01:14
Intro
-
Урок 174.
00:05:35
Segment Trees - SUPW with K
-
Урок 175.
00:08:30
SUPW with K (code)
-
Урок 176.
00:09:05
Fenwick Trees - Longest Increasing Subsequence (nlogn)
-
Урок 177.
00:08:25
LIS(code)
-
Урок 178.
00:25:01
Forward vs Backward DP approaches
-
Урок 179.
00:30:46
Same state and multiple recurrence relations
-
Урок 180.
00:05:34
Recover the best solutions
-
Урок 181.
00:06:38
Super Duper Memory and Time Optimisation - Subset Sum
-
Урок 182.
00:01:26
Warning
-
Урок 183.
00:25:28
Frogs - 1
-
Урок 184.
00:25:30
Forgs - 2
-
Урок 185.
00:21:51
Vacation
-
Урок 186.
00:26:03
Knapsack - 1
-
Урок 187.
00:40:54
Knapsack - 2
-
Урок 188.
00:26:42
LCS
-
Урок 189.
00:21:47
LCS(code)
-
Урок 190.
00:09:10
Longest Path
-
Урок 191.
00:07:43
Longest Path (code)
-
Урок 192.
00:09:21
Grid 1
-
Урок 193.
00:04:11
Grid 1 (code)
-
Урок 194.
00:07:50
Coins
-
Урок 195.
00:13:15
Coins (code)
-
Урок 196.
00:15:22
Sushi
-
Урок 197.
00:13:49
Sushi (code)
-
Урок 198.
00:13:31
Stones
-
Урок 199.
00:31:36
Deque (First solution)
-
Урок 200.
00:10:44
Deque (Second Solution)
-
Урок 201.
00:27:03
Candies
-
Урок 202.
00:09:58
Candies(code)
-
Урок 203.
00:13:14
Slimes
-
Урок 204.
00:18:04
Slimes (code)
-
Урок 205.
00:08:12
Matching
-
Урок 206.
00:05:39
Matching continues
-
Урок 207.
00:20:19
Matching (code)
-
Урок 208.
00:22:44
Independent Set
-
Урок 209.
00:09:18
Independent Set(code)
-
Урок 210.
00:18:28
Flowers
-
Урок 211.
00:05:43
Flowers using Segment Tree
-
Урок 212.
00:19:53
Flowers(code)
-
Урок 213.
00:16:54
Walk
-
Урок 214.
00:05:44
Walk(code)
-
Урок 215.
00:17:42
Digit Sum
-
Урок 216.
00:18:24
Digit Sum (code)
-
Урок 217.
00:25:16
Permutation
-
Урок 218.
00:17:22
Permutation Brute Force
-
Урок 219.
00:17:54
Permutation (code)
-
Урок 220.
00:22:48
Grouping
-
Урок 221.
00:15:17
Grouping (code)