Bob and Gifts

CodeChefOpen on judge ↗

Bob is looking to surprise his friend with n gifts.He knows the n shops where he can find those gifts.As Bob's friend is coming today to his home, he needs to quickly collect the gifts from all shops and reach his home at position Y.Bob is currently at position X.Assume all places are in single dimensional.Bob is asking you to find minimum distance which he needs to travel to collect all gifts and

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