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
Fate to hate#2850
Very easy
Odd divisors#2863
Very easy
Two lines#2902
Easy
Biprime numbers#2972
Very easy
Dial#2985
Easy
Camouflaged camp#3015
Very hard
Military parade#3027
Very easy
Digital row#3029
Very hard
Mutation#3036
Easy
Avoiding a disaster#3044
Medium
Alphabet Soup#3064
Very easy
Guess the Numbers#3069
Medium