Find maximum in an Array

CodeChefRating 650Open on judge ↗

Given a list of $N$ integers, representing height of mountains. Find the height of the tallest mountain. ### Input: - First line will contain $T$, number of testcases. Then the testcases follow. - The first line in each testcase contains one integer, $N$. - The following line contains $N$ space separated integers: the height of each mountains. ### Output: For each testcase, output one

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