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
Summer school#7801
Very easy
John's Test#7802
Very hard
Board Game#7804
Medium
Seven primes#7835
Medium
Safe#7884
Easy
Different lines.#8229
Very easy
n-digit numbers#8255
Very easy
Sum of divisors#8279
Very easy
The number of even divisors#8280
Very easy
Music#8283
Very easy
Prime palindromes#8289
Medium
Palindrome#8359
Easy
One rectangle#8375
Medium
Persistent Number#8377
Very easy
Keven#8495
Very hard
Puzzle#8512
Easy