← All problemsSign in

Break Failed

Chef was going in a journey driving a car. Suddenly he finds out that his car’s break has failed, now the only way to stop is to wait for fuel to get consumed fully. Chef’s car has mileage **M** (in kmpl). Chef car is driving between edges in a given undirected graph. Each edge is of length 1km The initial position of chef’s car is given as node number in graph. Some of the node are dangerous t

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

Sign in to chat with the tutor and save your progress.

Sign in to start