Skyscraper Equilibrium

CodeChefOpen on judge ↗

Chef had constructed 2 buildings - one of height N and another of height M. He was unhappy, and wanted both buildings to be of the same height. In one move, he could either add a floor to a building, or remove a floor from a building. Help him find the minimum number of moves to make the heights equal. Input First line contains a positive integer T - the total number of testcases. T lines fo

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