← All problemsSign in

Treasure Hunt

Problem Description Neha is designing the treasure hunt routes. She wants to put different routes for different teams, but she wants each team to have routes of equivalent difficulty. The difficulty of a routes depends on its shape and size. On a map of IISc, the co-organizer Sriram has drawn all available routes. Neha wants to group the routes based on their difficulty. Routes are of the same d

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

Sign in to chat with the tutor and save your progress.

Sign in to start