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
Hop - Don`t Walk#1275
Medium
Lamps Grid#1301
Very easy
Divisors#1347
Medium
Lucky Numbers#1372
Very easy
Palindometer#1380
Very easy
The Law of the Jungle#1409
Very easy
Reservoir Dogs#1410
Very easy
Homework#1422
Medium
ABC-rebuses#1444
Easy
Fortune Teller#1461
Very easy
Unbirthdays#1475
Very easy
Chess Puzzle#1488
Very easy
Moon#1490
Easy
Necklace#1491
Easy
Robot#1493
Medium
Lines#1499
Very easy
Sum And Product#1567
Very easy
Product Triplet#1568
Very easy
Elegant permuted sum#1593
Very easy