Oh My AlgorithmKO
←
Backtracking

Algorithms · Backtracking

Choose one to explore step by step

Searching by testing constraints and undoing choices

N-Queens

O(N!)

Place N queens on an N×N board without attacks between them.

Maze Solver

O(4^(N·M))

Find a path from start to destination while avoiding walls.

Sudoku Solver

O(9^(empty cells))

Fill blanks without repeating digits in any row, column, or 3×3 box.

Learning topics