01 Knapsack Problem Dynamic Programming
15:50
1.938.378
01 Knapsack Problem Dynamic Programming
System Design Introduction For Interview
27:23
552.185
System Design Introduction For Interview
System Design Design Autocomplete Or Typeahead Suggestions For Google Search
19:42
303.584
System Design Design Autocomplete Or Typeahead Suggestions For Google Search
Trie Data Structure
19:40
407.263
Trie Data Structure
Longest Increasing Subsequence
7:09
432.008
Longest Increasing Subsequence
System Design Distributed Database System Key Value Store
40:55
167.596
System Design Distributed Database System Key Value Store
System Design Design Messagingchat Service Like Facebook Messenger Or Whatsapp
29:16
348.625
System Design Design Messagingchat Service Like Facebook Messenger Or Whatsapp
Dijkstras Algorithm Single Source Shortest Path Graph Algorithm
16:20
392.070
Dijkstras Algorithm Single Source Shortest Path Graph Algorithm
Longest Common Subsequence
7:55
750.610
Longest Common Subsequence
Longest Palindromic Substring Manachers Algorithm
16:46
324.042
Longest Palindromic Substring Manachers Algorithm
Lowest Common Ancestor Binary Tree
11:08
249.295
Lowest Common Ancestor Binary Tree
System Design Design A Service Like Tinyurl
24:10
556.421
System Design Design A Service Like Tinyurl
Segment Tree Range Minimum Query
27:44
268.680
Segment Tree Range Minimum Query
Longest Palindromic Subsequence
9:18
311.772
Longest Palindromic Subsequence
Knuthmorrisprattkmp Pattern Matchingsubstring Search
12:50
1.120.046
Knuthmorrisprattkmp Pattern Matchingsubstring Search
Coin Changing Minimum Number Of Coins Dynamic Programming
8:33
479.631
Coin Changing Minimum Number Of Coins Dynamic Programming
Matrix Chain Multiplication
11:08
442.089
Matrix Chain Multiplication
Topological Sort Graph Algorithm
10:32
648.270
Topological Sort Graph Algorithm
Maximum Size Rectangle Of All 1S Dynamic Programming
6:55
180.445
Maximum Size Rectangle Of All 1S Dynamic Programming
Convex Hull Jarvis Marchgift Wrapping Algorithm
18:04
92.877
Convex Hull Jarvis Marchgift Wrapping Algorithm
Suffix Tree Using Ukkonens Algorithm
1:16:13
104.869
Suffix Tree Using Ukkonens Algorithm
Coin Changing Number Of Ways To Get Total Dynamic Programming
6:26
179.651
Coin Changing Number Of Ways To Get Total Dynamic Programming
Bellman-Ford Algorithm Single Source Shortest Path Graph Algorithm
21:32
201.208
Bellman-Ford Algorithm Single Source Shortest Path Graph Algorithm
Sparse Table Algorithm Range Minimum Query
27:33
56.816
Sparse Table Algorithm Range Minimum Query
Maximum Sum Rectangular Submatrix In Matrix Dynamic Programming2D Kadane
13:54
201.381
Maximum Sum Rectangular Submatrix In Matrix Dynamic Programming2D Kadane
Binary Search Median Of Two Sorted Arrays Of Different Sizes
24:48
536.866
Binary Search Median Of Two Sorted Arrays Of Different Sizes
Prims Algorithm Minimum Spanning Tree Graph Algorithm
19:13
292.724
Prims Algorithm Minimum Spanning Tree Graph Algorithm
Lowest Common Ancestor Binary Search Tree
4:16
75.207
Lowest Common Ancestor Binary Search Tree
Maximum Sub Square Matrix Dynamic Programming
3:52
106.489
Maximum Sub Square Matrix Dynamic Programming
Weighted Job Scheduling Dynamic Programming
7:13
196.177
Weighted Job Scheduling Dynamic Programming
Minimum Edit Distance Dynamic Programming
9:47
514.533
Minimum Edit Distance Dynamic Programming
Egg Dropping Dynamic Programming
11:17
197.463
Egg Dropping Dynamic Programming
Kruskals Algorithm Minimum Spanning Tree Graph Algorithm
8:42
305.257
Kruskals Algorithm Minimum Spanning Tree Graph Algorithm
N Queen Problem Using Backtracking Algorithm
18:04
341.053
N Queen Problem Using Backtracking Algorithm
Knuthmorrisprattkmp Pattern Matchingsubstring Search Part2
9:20
230.669
Knuthmorrisprattkmp Pattern Matchingsubstring Search Part2
String Interleaving Dynamic Programming
7:47
90.937
String Interleaving Dynamic Programming