N Queens is the classic example of backtracking with pruning: place queens row by row and abandon a branch as soon as two queens attack. Checking columns and diagonals in O(1) is what makes it fast enough. The same idea of rejecting partial solutions early solves Sudoku and word search on a grid. Interviewers use it to see if you can write clean choose, explore and undo code.