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
Factorials#704
Very easy
Zero#705
Very easy
Ternary Logic#733
Very easy
Power#735
Hard
Short track#738
Hard
Snowboarding#743
Hard
Robot#759
Hard
Determinant#762
Hard
Informants#782
Medium
Langton's Ant#787
Medium
Solitaire#804
Easy
Loto#812
Very easy
Shooting Range#828
Very hard
TV tower#829
Very easy
Prime numbers#830
Very easy
Expression#831
Easy
Permutations#837
Very easy
Decomposition into terms#849
Very easy
Brackets (2)#855
Very easy