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
Tribute#9100
Medium
Boys and Girls#9434
Very easy
Chocolate bar#9538
Very easy
Photoshoot#9597
Easy
Lanterns#9612
Hard
Biodiversity#9703
Very easy
Ponk Warshall#9767
Very easy
Cardboard Container#9880
Very easy
The smallest even#9960
Very easy
Permutations of n by k#9961
Very easy
All subsets#9962
Easy
Two-digit numbers#9985
Very easy
Two-digit numbers 2#9986
Very easy
Two-digit numbers 3#9987
Very easy
Two-digit numbers 4#9988
Very easy
Two-digit numbers 5#9989
Very easy
Two-digit numbers 6#9990
Very easy
Three-digit numbers#9991
Very easy