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
Nuts#8769
Hard
Class#8770
Very easy
Elections#8774
Very easy
Rules#8775
Medium
Disqualification#8778
Very easy
The largest of three#8871
Very easy
Square#8882
Very easy
Each condition of two#8893
Very easy
None of the two conditions#8894
Very easy
The smallest of the largest 3#8902
Very easy
Previous number 2#8903
Very easy
Previous Number 4#8905
Very easy
The largest among smaller#8906
Very easy
Perfect cubes#8919
Very easy
Non-Multiples of 2 3 5#8920
Very easy
Odds in the interval#8935
Very easy
Fashion Elements 3#8975
Very easy
Fashion Elements 4#8976
Very easy
Secret code#9055
Easy
Combination lock#9057
Medium
Game "15++"#9082
Easy