## Problem You have a list of monsters, each with `(health, attack)`. Two monsters fight: each round, both deal their attack value to the other simultaneously. A monster dies when its health reaches 0 or below. Given your monster and a list of opponents, return how many you can defeat. For a follow-up variant: you can choose the fight order. You keep your current health between fights. Determine the maximum number of monsters you can defeat before dying. ```python def fights_won( my_health: int, my_attack: int, opponents: list[tuple[int, int]] # (health, attack) ) -> int: ... ``` ``` Input: my_health=10, my_attack=3, opponents=[(6,2),(15,1),(4,4)] Vs (6,2): I deal 3/round -> 2 rounds to kill. I take 2*2=4 dmg. Survive (6 HP left). Vs (15,1): 5 rounds. I take 5 dmg. Survive (1 HP left). Vs (4,4): 2 rounds. I take 8 dmg. Die. Order: fight in order given -> 2 wins. Optimal order might differ. ``` ## Follow-ups 1. Prove or disprove: greedy (fight lowest-attack opponents first) always maximizes wins. 2. What if you have a one-time shield that blocks all damage in one round — when should you use it? 3. Extend to a tournament bracket: monsters fight each other, not you. Who wins? 4. How would this change if attack values can vary randomly each round (dice roll)?

InterviewDB Experience

Monster Fights: Simulate Battle Outcomes and Determine Winning Strategy

phone

Interview Experience

Problem You have a list of monsters, each with (health, attack). Two monsters fight: each round, both deal their attack value to the other simultaneously. A monster dies when its health reaches 0 or below. Given your monster and a list of opponents, return how many you can defeat. For a follow-up variant: you can choose the fight order. You keep your current health between fights. Determine the maximum number of monsters you can defeat before dying. Follow-ups Prove or disprove: greedy (fight lo…

Full Details

🔒

Unlock all Confluent questions

Full insider details, leaked discussions, and candidate experiences.

Get full access — $100 a year, unlimited access

About This Question

This is a candidate experience report from a confluent interview during the phone round.

It covers the following topics: Coding, Greedy, Phone, Onsite .

Topics

Coding Greedy Phone Onsite

Monster Fights: Simulate Battle Outcomes and Determine Winning Strategy

Interview Experience

Full Details

About This Question

Topics

More Confluent Interview Questions