Many hard LeetCode problems are easy constraint problems
September 10, 2025 Many Hard Leetcode Problems are Easy Constraint Problems Use the right tool for the job. In my first interview out of college I was asked the change counter problem: Given a set of coin denominations, find the minimum number of coins required to make change for a given number. IE for USA coinage and 37 cents, the minimum number is four (quarter, dime, 2 pennies). I implemented the simple greedy algorithm and immediately fell into the trap of the question: the greedy algor