Money to Burgers with a $20 Bill

This brain teaser is about converting a fixed amount of money into as many identical items as possible, then using the leftover to compute a derived quantity. It lives at the intersection of basic arithmetic and discrete reasoning, a classic warm-up in quant prep that still reveals whether a candidate is precise with units, currencies, and simple formulas under interview pressure.

It trains comfort with integer division, remainders, and translating a word description of purchases into a clean algebraic structure. You must track dollars versus cents, ensure consistency of units, and keep the discrete nature of the count firmly in mind. That blend of number sense and symbolic thinking is exactly what early-stage quant interviews quietly probe.

This matters for quant interviews because front-office roles at banks and hedge funds hinge on error-free manipulation of simple quantities under time pressure. Interviewers use such puzzles to see if you can quickly formalize an everyday scenario into a discrete math framework, avoid off-by-one and unit mistakes, and compute a nontrivial expression based on that structure. These are the same skills you rely on when implementing payoff logic, settlement rules, or discrete risk calculations in real quant work.

What it tests

Whenever you have a fixed total and repeatedly subtract a fixed cost to maximize the number of whole items you can buy, you are performing integer division. The key structure is that the total can be written as $q \times d + r$, where $q$ is the number of items, $d$ is the cost per item, and $r$ is the remainder or leftover. This decomposition is fundamental in problems about making change, partitioning, or maximizing discrete purchases. The product $q \cdot r$ often appears in such problems, and its value is determined by the interaction between the divisor and the remainder, not just by the total. The reason this pattern holds is that integer division naturally splits a total into the largest possible multiple of the divisor plus a leftover, which is always less than the divisor.