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
Magic pyramid#6865
Very hard
Collatz Conjecture#6897
Very easy
Sum of GCD#6941
Easy
Unlock my safe#6953
Very easy
Nonogram#6957
Easy
Federation Favorites#6966
Very easy
Magic Multiple#6975
Medium
Rings and Runes#6978
Medium
Ritual Circle#6979
Very hard
2D-Solar System#6991
Very hard
Let it Bead#7079
Medium
Terusky#7111
Very easy
Rectangle#7192
Medium
Cryptogram#7199
Very hard
Game "Row of Chips"#7201
Medium
Mixing Colours#7216
Very hard
Beautiful Numbers#7237
Medium
Segments#7254
Very easy
Marisia and Stepan#7297
Very hard
Code Lock#7300
Hard