Tushar Roy - Coding Made Simple

Suffix Tree using Ukkonen's algorithm

Regular Expression Dynamic Programming

Topological Sort Graph Algorithm

Root To Leaf Sum Binary Tree

Longest Palindromic Substring Manacher's Algorithm

Maximum Sum Increasing Subsequence Dynamic Programming

Lowest Common Ancestor Binary Search Tree

Combination of Characters in String (All subsets of characters)

Sum Query in 2D Immutable Array Dynamic Programming

Text Justification Dynamic Programming

System Design : Distributed Database System Key Value Store

String Permutation Algorithm

0/1 Knapsack Problem Dynamic Programming

Longest Increasing Subsequence

Maximum Rectangular Area in Histogram

Skyline Problem

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

System Design Introduction For Interview.

Check if Binary Tree is Binary Search Tree

Iterative Postorder traversal of binary tree using one stack

Disjoint Sets using union by rank and path compression Graph Algorithm

Burst Balloon Dynamic Programming[Leetcode]

Ford Fulkerson Algorithm Edmonds Karp Algorithm For Max Flow

Strongly Connected Components Kosaraju's Algorithm Graph Algorithm

Coin Change Top down dynamic programming

Sparse Table Algorithm Range Minimum Query

Lowest Common Ancestor Binary Tree

Trie Data Structure

N Queen Problem Using Backtracking Algorithm

Kruskal's algorithm Minimum Spanning Tree Graph Algorithm

System Design : Design a service like TinyUrl

Morris Inorder Tree Traversal

Suffix Tree using Ukkonen's algorithm

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

Detect Cycle in Directed Graph Algorithm

Coin Changing Number of ways to get total dynamic programming

Longest Common Substring

Minimum Cost Path Dynamic Programming

Convex Hull Jarvis March(Gift wrapping algorithm)

Subset Sum Problem Dynamic Programming

Longest Palindromic Subsequence

Red Black Tree Deletion

Cycle in Undirected Graph Graph Algorithm

Z Algorithm Z values

Minimum Edit Distance Dynamic Programming

Articulation Points Graph Algorithm

Segment Tree Range Minimum Query

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

Optimal Binary Search Tree

Prim's Algorithm Minimum Spanning Tree Graph Algorithm

Maximum Sum Subsequence Non-Adjacent