- Union Find(Weighted union-union by rank, collapsing find)
- Knuth Morris Pratt algorithm for pattern matching
- Graph Colouring(m colouring problem - Backtracking)
- Ford-Fulkerson's algorithm for max network flow
- N Queens Problem (Backtracking)
- Bin Packing
- Job Scheduling
- Self Descriptive Number
- Bellman Ford(Single Source Shortest path)
- Floyd Warshall(All pairs shortest path)
- Prims MST