Minimum Coins for Payment with Change

CodingSnowflakeLast reported February 2026Low Frequency
Reported
1× across candidate reports
First seen
February 2026
Last reported
February 2026
Reported outcome
unknown

Problem Overview

Given an infinite supply of coins with denominations [1, 5, 10, 50, 100, 200], find the minimum total number of coins needed to pay exactly amount n. You are allowed to overpay, and the recipient will give back change using the same coin denominations (also minimally). The goal…

  • The rest of the problem statement — full requirements, constraints, and edge cases
  • Approach and trade-offs — what passing candidates did, and the mistakes that sink people
Unlock the full Snowflake catalog
Full problem statements, candidate-reported follow-ups, and walkthroughs — for every Snowflake question.
Unlock with Pro
Already a member? Sign in
Verified Source
Every question is reconstructed from multiple independent candidate reports. Verbatim follow-ups, not invented ones.
Codex Fact-Checked
Technical claims, formulas, and scale numbers are reviewed against primary sources.
Interviewer Follow-ups
The exact follow-ups reported by candidates, with the trigger that prompts each one — plus the mistakes that sink people.
Is this helpful?