- Coin Change I
- Print All Denomination
- Coin Change II
- Edit Distance
- Longest Common Subsequence
- Wild Card Matching
- 0-1 Kanpsack
- Regular Expression Matching
- Minimum Cut Palindrome Partitioning
- Maximal Rectangle Area In Histogram
- N-th Ugly Numbers
- N-th Catalan Numbers
- Number Of Ways To Partition A Set
- Maximum Gold Mining From Given Grid
- Friend Pairs Problem
- Rod Cutting Problem
- Count Numbers Of Way To Cover A Distance
- Bipartite Checking
- Bipartite Checking
- Breadth First Search
- Depth First Search
- Dijkstra Single Source Shortest Path
- Find Cycle In Graph
- Topological Sorting
- KosaRaju Strongly Connected Component
- Tarjan Algorithm Remove Bridges
- Minimum Spanning Tree - Kruskal
- BellMan-Ford Single Source Shortest Path
- Longest Palindromic Substring
- Search For ASubstring In A String
- KMP String Pattern Match
- Maximum Occurrence Of Prefix In The Array
- Frequency Of A SubString In A String
- String Hashing
- Number of Unique Substring of given String
- Find All Unique Substring of a String
- Find All Substring of a String
- Count Number Of Palindromic Substring In A String
- Print All Palindromic Substring