Powerful Soldier

CodeChefOpen on judge ↗

There is a number assigned to every soldier in the war. You are given a list soldier of size n in which soldier[i] is the soldier’s number which fought in the war at time i. You have to return the powerful soldier’s number. The powerful soldier is the soldier who appears more than n/2 times in the war. You may assume that powerful soldier always exist. Constraints: - n== soldier.length - 1 4 -23

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