โ† Samsung questions

Coin change problem using greedy approach

Filed under Samsung

Given an infinite supply of coin denominations and a target sum, determine the minimum number of coins needed to make up that target using a greedy approach, assuming standard canonical coin systems.

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related Samsung questions

Collected from public candidate posts and coding forums. Updated Nov 2026.