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
Triangles#461
Medium
Height#473
Very easy
Maximum#474
Easy
Multiple#476
Hard
Sum of cubes#477
Easy
Inexact string#486
Very hard
Assignment of Nicholas#517
Very easy
Database#524
Very easy
Funny Language#526
Very hard
A No-Win Situation#538
Medium
Racing Game#546
Medium
Flight Planning#548
Very easy
Polar ones#573
Easy
Sequence-2#582
Easy
Scoreboard#606
Easy
Game#607
Hard
New illusion#613
Very easy
Lotto#617
Easy
Ships#629
Hard