There are 9 coins and a weighing balance. 8 coins are of the same weight and 1 coin is heavier. In how many minimum numbers of iterations can you find out the heaviest coin in the worst case?

There are 9 coins and a weighing balance. 8 coins are of the same weight and 1 coin is heavier. In how many minimum numbers of iterations can you find out the heaviest coin in the worst case?

题目类型: 技术面试题

这是一道技术面试题，常见于澳洲IT公司面试中。

难度: easy

标签: interviewbit, pwc, company-specific

目标公司: PricewaterhouseCoopers

参考答案摘要

Most people try to divide the coins into 2 groups. But the trick here is to divide them into 3 groups. The reason being if we divide coins into 2 groups and weigh them, we can only discard one group. ...

本题提供 STAR 原则详细解答和技术解析，登录匠人学院学习中心即可查看完整答案、收藏题目并进行模拟面试练习。