Solve two logic brain teasers

Quick Overview

This pair of puzzles evaluates logical deduction and optimization competencies—one testing information-theoretic reasoning with constrained ternary comparisons and the other testing sequencing and scheduling trade-offs for minimal total time—and belongs to the Cognitive Ability / Logic category.

Solve two logic brain teasers

Company: Citi

Role: Software Engineer

Category: Statistics & Math

Difficulty: medium

Interview Round: Onsite

Answer both puzzles: ( 1) You have 12 visually identical balls; exactly one is heavier than the others. Using a balance scale only three times, determine which ball is heavier and justify that three weighings are sufficient and necessary. ( 2) Four people must cross a bridge at night with one torch. Their crossing times are 1, 2, 7, and 10 minutes. At most two can cross at a time, and anyone crossing must carry the torch. What is the minimum total time and what sequence achieves it? Prove optimality.

Overview: This pair of puzzles evaluates logical deduction and optimization competencies—one testing information-theoretic reasoning with constrained ternary comparisons and the other testing sequencing and scheduling trade-offs for minimal total time—and belongs to the Cognitive Ability / Logic category.

|Home/Statistics & Math/Citi
Citi logo
Citi
Sep 6, 2025
mediumSoftware EngineerOnsiteStatistics & Math
7
0

Two Classic Logic/Optimization Puzzles

Puzzle 1: Heavier Ball with a Balance Scale

You have 12 visually identical balls. Exactly one ball is heavier than the others; all remaining balls have equal weight. You have a balance scale and may use it at most three times. Determine which ball is heavier and justify that three weighings are both sufficient and necessary.

Notes:

  • A balance scale comparison yields three outcomes: left side heavier, right side heavier, or balance.
  • The odd ball is known to be heavier (not lighter).

Puzzle 2: Bridge and Torch

Four people must cross a bridge at night with one torch. Crossing times are 1, 2, 7, and 10 minutes. At most two can cross at a time, and the torch must be carried whenever anyone crosses. Find:

  1. The minimum total crossing time.
  2. A sequence of crossings that achieves it.
  3. A brief proof of optimality (why no faster schedule exists).
Loading comments...