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
Phone List#2303
Very easy
Permutations (Easy)#2315
Very easy
Refrain (Easy)#2320
Medium
Balance of parentheses#2331
Very easy
NSC#2339
Hard
Who is longer?#2362
Very easy
Fibonacci subsequence#2363
Very easy
Cube Coloring#2372
Very easy
High security#2377
Medium
Sorting Game#2384
Very easy
Partitions into summands#2390
Very easy
Number#2394
Medium
Semiperfect number#2395
Medium
Book#2399
Easy
Game of Chips#2444
Very easy