Easy Arrays

CodeChefOpen on judge ↗

You are given an Array of $N$ elements where the value of $i$-th element is the height of $i$-th Student where $0 \leq i \le N$. Print the maximum height difference between any two students. ### Input - There are two lines of input, where the first line contains an integer $N$(number of students) and the second line contains $N$ positive integers(height of student) separated by space. ### Outpu

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