Reported interview periodJan 2026–Aug 2026
Crossword Constraint Solver
Given a crossword grid, a set of across/down clue entries, and candidate words for each clue, fill the grid so every entry uses one candidate and all crossing letters agree.
Practice focusRequirements - Define data structures for grid cells, clue slots, candidate domains, and crossing constraints. - Return one valid completed grid or report that none exists. - Use constraint propagation and backtracking rather than enumerating every combination. - Choose a search order such as minimum remaining values, and explain tie-breaking. - Restore domains correctly after a failed branch. - Handle prefilled letters, duplicate candidate words, disconnected regions, and ambiguous puzzles.…