A - D4RK4RMY and V3NOM
CodeChefOpen on judge ↗
There is a array $A$ of length $N$ and Raj is standing on the 1st position in the array and Dipanshu is standing in the last position in the array. Raj and Dipanshu both jump simultaneously. If the position $i$ where Raj is standing at has value $A_i$, then he will jump to index $i+A_i$ in the next step. (He can jump out of the array i.e beyond $N^{th}$ position ). If the position $j$ where Dip
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.
Sign in to chat with the tutor and save your progress.
Sign in to start