Tiny streets

CodeChefOpen on judge ↗

Problem description. A delivery man needs to deliver grocery to certain location. Every day when a delivery order is placed he has many streets that he can take to reach the destination. The man likes to take the most narrowest street of all(cuz he’s riding a bicycle duh! Less traffic :p) An ARRAY of numbers is given to the delivery boy. These numbers indicate the width of the streets(the narrow

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