Defective Gold coin

CodeChefOpen on judge ↗

Given $n$ identical looking coins and a weighing scale (you can put any number of coins on both sides of scale and it will tell total weight of which side is higher, or if they are equal). The weights of $n-1$ of these coins is same, remaining one is defective and its weight is more than other $n-1$ coins. Find the minimum number of weighing required in the worst case to figure out the defective c

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI