MAX CANDY

CodeChefOpen on judge ↗

Chef has $N$ boxes in front of him. Each of the $i th$ boxes has some amount of candies in it. Chef wants to grab the maximum number of candies. However, he has been told that he can’t take candies from adjacent boxes. Help Chef get the maximum number of candies. ### Input - The first line of input will contain a single integer $T$, denoting the number of test cases. - The first line of each tes

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