Jethalal and Mehta

CodeChefOpen on judge ↗

Jethalal is traveling from City $A$ to City $B$ for his Business meeting. And while onboarding the train, he gets a call from his closest friend Mehta and came to know that Mehta was travelling from City $C$ to City $D$. And they decided to meet each other at the station that is common between their respective train's route. Imagine the route of the train as a cartesian-co-ordinate system. Your

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