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
Three digit numbers#4101
Medium
Subsets generation#4106
Very easy
Fir Trees#4193
Easy
Box of chocolate#4203
Medium
Four Gate Push#4225
Medium
Cloudlet#4236
Very hard
Puzzle#4242
Very easy
Babs` Box Boutique#4267
Very easy
Hexagon Perplexagon#4269
Very easy
Road Series#4272
Easy
Stepan and Matches#4287
Very easy
Happy Birthday!!!#4353
Very easy
T-shirter#4358
Easy
Loopy transit#4409
Medium