Intermediate · Coding interviews: heaps, recursion and intervals
Backtracking
Six interview problems solved by trying a choice, going on, and taking it back: every balanced bracketing, the combinations that add up to a total, queens on a board, a word traced through a grid of letters, the splits of a text into palindromes, and a sudoku.
- You build
- brackets.py, then totals.py, then queens.py, then grid.py, then palindromes.py, then sudoku.py
- Stages
- 6 Problems
- Time
- About 2 hours
Loading the workspace…
Loading the workspace…