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
Brujo Don Pedro#4893
Medium
Democracy Advances#4938
Very hard
Ones and Zeroes#4959
Very hard
Maze#4966
Medium
Co-workers from Hell#5042
Very easy
Magic constant#5064
Very easy
Sum of digits#5083
Very easy
VSHEOM-43#5153
Easy
Preference#5202
Very hard
Palindrome#5228
Very easy
Reversi#5243
Very hard
Two strings#5250
Very hard
Penalty#5252
Easy
Gifts#5258
Medium
New issue#5264
Easy
Petya Slonikov#5265
Very easy
Substring (Easy)#5290
Very easy
Magic Square#5300
Medium
Matrix (Easy)#5313
Very hard