MIN WALK

CodeChefOpen on judge ↗

There are N houses along the street. The i-th house is located at coordinate Ai. Chef has decided to deliver gifts to all these houses. Find the minimum distance to be traveled when the chef can start and end his travel at any position. ###Note: There may be more than one house at a position. ###Input: - First-line will contain $N$, number of houses. - The next line contains N space-s

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