-
Count Inversions in an array
-
Median of two sorted array
-
Biconnected Graph
-
Breadth First Search (BFS) for a Graph
-
Bridges in a Graph
-
Check if a given graph is tree or not
-
Connectivity in a directed graph
-
Depth First Search (DFS) for a Graph
-
M-Coloring Problem
-
N Queen Problem
-
Rat in a Maze Problem
-
Solving Cryptarithmetic Puzzles
-
Subset Sum Problem
-
Sudoku Solving algorithms
-
The Knight’s tour problem
-
Tug of War Algorithm
-
Word Break Problem
-
Max Number By Swapping
-
Efficient Construction of Finite Automata
-
kasai’s Algorithm