← All problemsSign in

Suneo A Greedy Kid

$Suneo$ is one of the most greedy kids of the show who likes to show-off his toys and comics. He always tries to maximise his score in any game he plays. In this problem $Suneo$ is given an array of integers of size $n$ and he is asked to move from $l^{th}$ index of the array to $r^{th}$ by taking any number of moves between $1$ to $k$. In any single move $Suneo$ can move from $i^{th}$ index to

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