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
Even negative numbers in matrix#8525
Very easy
Numbers with different digits#8533
Very easy
Pair Sum Divisibility#8548
Very easy
Shopping#8554
Easy
Clubs#8560
Easy
Products#8581
Medium
sgn function#8608
Very easy
Outside the interval#8615
Very easy
Divisibility by digits#8622
Very easy
At least two equal digits#8624
Very easy
At least one odd#8629
Very easy
Numbers with odd digits#8640
Very easy
Three digit Armstrong numbers#8641
Very easy
Squarow#8644
Easy
Bishops on Black#8648
Medium
Crystal (Unknown)#8650
Medium
Credit#8661
Very easy
Find a sequence#8699
Very easy
Flexible Segments#8715
Very easy