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
Anchored Balloon#6106
Very hard
ABC#6137
Easy
Omicronian Domino#6145
Very hard
Checkers#6192
Very easy
Triangles#6196
Medium
Goldbach`s Conjecture#6201
Very easy
Shotcube#6202
Very hard
4 thought#6206
Easy
Unhappy Numbers#6218
Medium
Permutations#6248
Very easy
Heavy Chain Clusterization#6267
Very hard
Intellectual Property#6268
Very hard
Division of the Treasure#6274
Very easy
Bet#6282
Very easy
Illness#6284
Easy
Hard Life#6298
Very hard
Kickdown#6301
Medium
Findword#6312
Hard
Calculator#6319
Very hard
Neighbors#6320
Easy
Maharaja#6362
Very easy
Letter Cubes#6383
Very easy