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
Find Minimum#5328
Very easy
The Alliances#5341
Very hard
PIN#5345
Very hard
Fatigue and Patience#5382
Very easy
Stylish#5413
Medium
Artokhlam#5452
Easy
Greetings#5454
Medium
Sneaky elephant calf#5456
Very easy
Matches#5460
Very hard
Set#5461
Medium
Hairdresser#5477
Very hard
Ancient Civilizations#5487
Very hard
Sith vs Jedi#5503
Medium
Chocolate#5532
Easy
Mundial#5615
Medium
Algorithm of Professor Ivanov#5616
Very easy
Pirate Chest#5658
Very hard
Business Cards#5732
Very easy
Two professors#5737
Very easy
King`s Poker#5750
Medium