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 Password#5752
Very easy
Firefighters#5757
Medium
Test#5762
Medium
Phigon#5776
Very hard
Search of Concatenated Strings#5792
Very hard
Asterisk#5882
Medium
Triplets#5894
Very easy
Word number#5921
Easy
Palindromes#5949
Very hard
Triplets - 2#5975
Medium
Kings of the Forest#6025
Very easy
Boggle#6030
Easy
A Cycle of Points#6087
Medium