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

Fenwick Tree or Binary Indexed Tree

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

Total Ways in Matrix Dynamic Programming

Minimum Edit Distance Dynamic Programming

Suffix Tree using Ukkonen's algorithm

System design : Design Autocomplete or Typeahead Suggestions for Google search

Wildcard Matching Dynamic Programming

Palindrome Partition Dynamic Programming

Check if Binary Tree is Binary Search Tree

Z Algorithm Z values

Coin Changing Minimum Number of Coins Dynamic programming

Prim's Algorithm Minimum Spanning Tree Graph Algorithm

Rabin Karp Substring Search Pattern Matching

Matrix Chain Multiplication

Longest Palindromic Subsequence

Maximum Sub Square Matrix Dynamic Programming

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

Longest Common Subsequence

Trie Data Structure

Skyline Problem

System Design Introduction For Interview.

Iterative Postorder traversal of binary tree using one stack

N Queen Problem Using Backtracking Algorithm

Sparse Table Algorithm Range Minimum Query

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

Coin Changing Minimum Coins Dynamic Programming

Burst Balloon Dynamic Programming[Leetcode]

Longest Increasing Subsequence

Binary Search Tree Search

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

Morris Inorder Tree Traversal

Egg Dropping Dynamic Programming

Box Stacking Dynamic Programming

Maximum Size Rectangle of All 1's Dynamic Programming

Segment Tree Range Minimum Query

Bellman-Ford Algorithm Single Source Shortest Path Graph Algorithm

Detect Cycle in Directed Graph Algorithm

Traveling Salesman Problem Dynamic Programming Held-Karp