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
Cocircular Points#3747
Very easy
Jollo#3754
Easy
Watches#3808
Very hard
Maximum Power#3823
Medium
Grocery store#3839
Very easy
Halloween treats#3840
Very easy
Beth Tableaux#3857
Very hard
Ancient Roman Years#3884
Very easy
Half#3905
Medium
Iguana#3931
Hard
Subsets#3950
Easy
License plates#3953
Very easy
Tichu#4015
Hard
N Queens#4044
Medium
Herbarium#4062
Medium
Electronic Hunting#4067
Very hard
Permutation#4079
Very easy
Triangle#4086
Very hard