FIND WHEN

CodeChefOpen on judge ↗

In a town, there are $n$ cable cars on a rope way. Initially each of them will be at different positions($x$). i.e; at time ($t=0$). Now starting from their respective positions($x$), each of them moves with different velocities($v$). You have to find if at-least one cable car can get damaged. i.e; If they have a chance to collide. They can only collide in opposite directions only. If the $v_i$ is

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