Shubham, Diwali and Choclates

CodeChefOpen on judge ↗

Shubham is living in a village where Diwali(An indian festival) is celebrated by distributing chocolates among youngers.There are $N$ buildings along a straight path,in each building only one person lives.This means Shubham can gain or lose maximum one chocolate in each building depending on whether the person in that building is older or younger than Shubham.He has map of that village, where data

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