#Java 1D Array (Part 2)

Hackerrank Java 1D Array (Part 2) Solution

Let's play a game on an array! You're standing at index of an -element array named . From some index (where ), you can perform one of the following moves: Move Backward: If cell exists and contains a , you can walk back…