ADITYAs CHALLENGE

CodeChefOpen on judge ↗

Geet and Aditya met in a train. Geet started telling Aditya her stories but Aditya is already in a depressed state and soon started getting irritated from her stories when it became unbearable for him he gave Geet a challenge. Geet is given an array $A$ = $[A0,A1,A2,…,AN-1]$ consisting of $N$ non negative integers. Aditya will continue listening to Geet’s stories if sum of numbers at odd indices

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