40:55

System Design : Distributed Database System Key Value Store

27:23

System Design Introduction For Interview.

29:16

System Design : Design messaging/chat service like Facebook Messenger or Whatsapp

24:48

Binary Search : Median of two sorted arrays of different sizes.

19:42

System design : Design Autocomplete or Typeahead Suggestions for Google search

18:04

Convex Hull Jarvis March(Gift wrapping algorithm)

24:10

System Design : Design a service like TinyUrl

27:22

Burst Balloon Dynamic Programming[Leetcode]

18:34

Sum Query in 2D Immutable Array Dynamic Programming

18:34

Regular Expression Dynamic Programming

04:16

Lowest Common Ancestor Binary Search Tree

27:33

Sparse Table Algorithm Range Minimum Query

11:08

Lowest Common Ancestor Binary Tree

14:05

Iterative Postorder traversal of binary tree using one stack

19:40

Trie Data Structure

18:18

Combination of Characters in String (All subsets of characters)

11:44

Morris Inorder Tree Traversal

18:04

N Queen Problem Using Backtracking Algorithm

16:38

Wildcard Matching Dynamic Programming

20:48

Coin Changing Minimum Coins Dynamic Programming

25:09

String Permutation Algorithm

10:43

Detect Cycle in Directed Graph Algorithm

22:54

Skyline Problem

29:09

Buy/Sell Stock With K transactions To Maximize Profit Dynamic Programming

38:01

Ford Fulkerson Algorithm Edmonds Karp Algorithm For Max Flow

16:57

Rabin Karp Substring Search Pattern Matching

19:26

Floyd Warshall Algorithm All Pair Shortest Path Graph Algorithm

21:32

Bellman-Ford Algorithm Single Source Shortest Path Graph Algorithm

20:21

Traveling Salesman Problem Dynamic Programming Held-Karp

26:09

Johnson's Algorithm - All simple cycles in directed graph

34:29

Red Black Tree Deletion

42:57

Red Black Tree Insertion

24:03

Z Algorithm Z values

15:45

0/1 Knapsack Problem Top Down Dynamic Programming

16:20

Dijkstra's Algorithm Single Source Shortest Path Graph Algorithm

19:13

Prim's Algorithm Minimum Spanning Tree Graph Algorithm

08:42

Kruskal's algorithm Minimum Spanning Tree Graph Algorithm

15:40

Coin Change Top down dynamic programming

26:46

Articulation Points Graph Algorithm

24:30

Strongly Connected Components Kosaraju's Algorithm Graph Algorithm

28:27

Lazy Propagation Segment Tree

10:32

Topological Sort Graph Algorithm

12:03

Longest Increasing Subsequence in nlogn time

12:23

Cycle in Undirected Graph Graph Algorithm

16:46

Longest Palindromic Substring Manacher's Algorithm

17:49

Disjoint Sets using union by rank and path compression Graph Algorithm

15:50

0/1 Knapsack Problem Dynamic Programming

09:20

Knuth–Morris–Pratt(KMP) Pattern Matching(Substring search) Part2

12:50

Knuth–Morris–Pratt(KMP) Pattern Matching(Substring search)

01:16:13

Suffix Tree using Ukkonen's algorithm

10:51

Box Stacking Dynamic Programming

06:55

Maximum Size Rectangle of All 1's Dynamic Programming

09:43

Largest BST in Binary Tree

15:14

Maximum Rectangular Area in Histogram

15:31

Text Justification Dynamic Programming

13:54

Maximum Sum Rectangular Submatrix in Matrix dynamic programming/2D kadane

22:43

Fenwick Tree or Binary Indexed Tree

06:54

Reverse level order traversal binary tree

20:00

AVL Tree Insertion

27:44

Segment Tree Range Minimum Query