Self driving car

CodeChefOpen on judge ↗

You are designing an A.I. for a self-driving car. You have to implement an algorithm to solve the situation described below. You are provided with the map of a city , co-ordinates of your destination , and the maximum time to reach the destination. You have to decide whether the destination can be reached within the allotted time, and how much time will be remaining in best case. The map is giv

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