Brute force
Problems solved by brute force, including trying every number in a range, all permutations and subsets, digit puzzles and rebuses, small boards and combination locks, and checking every pair or triple when the input is small.
The backtracking and recursion articles in the Basics section explain how to enumerate options and cut branches early. Related problem sets are under Bitmasks and Meet-in-the-middle.
Problems
Hidden Code#3382
Medium
Fibonacci Words#3390
Very easy
Sudoku#3521
Very easy
Su-Su-Sudoku#3523
Very easy
Sudoku#3525
Easy
Rice Company#3536
Very easy
Kaeru Jump#3542
Medium
Dungeon Wall#3544
Medium
Care for a chat?#3606
Very easy
Petoris#3625
Medium
Tiling#3645
Very easy
How many different?#3650
Very easy
Without reciprocity#3654
Very easy
Domino#3668
Easy
Accordion#3674
Easy
Bingo!#3746
Easy