4 min read Sudoku Solver (LeetCode 37) is the canonical backtracking problem that tests constraint propagation, pruning, and disciplined state management. It appears […] Read article
3 min read Generating all subsets (the power set) is a fundamental combinatorics problem that tests backtracking, bit manipulation, and your understanding of Read article
2 min read The N-Queens problem is the classic backtracking problem. It places N chess queens on an N×N board so no two Read article
4 min read Problem: you are given a sequence of numbers from 1 to n-1 with one of the numbers repeating only once. Read article
3 min read This is difficult to describe in words, so read this carefully, lest there be any confusion. You have a normal Read article
1 min read how many trailing zeroes are there in 100! (100 factorial)? Solution One per factor of 10, and one per factor Read article
