← All problemsSign in

Geek Sundaram in AlgoLand

Problem description Geek Sundaram has been transferred to the city of "Algo-land". Algo-land is a strange city which has a lot of tall buildings. He is overwhelmed at this and decides to come up with a new problem out of this. He has collected the heights of all the buildings. Now he gives you these values and asks you to find the following: How many different pairs of buildings exist such tha

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