Java-1D-Array-(Part-2).java

import java.util.*;

public class Solution {

    public static boolean canWin(int leap, int[] game) {
        // Return true if you can win the game; otherwise, return false.
        
        if(game == null)
            return false;
        return solveWin(leap, game, 0);
    }
    
    public static boolean solveWin(int leap, int[] game, int i)
    {
        //Base Cases
        if(i>=game.length)
            return true;
        else if(i<0 || game[i]==1)
            return false;
        
        //mark as visited
        game[i]=1;    
        
        //Recursive Cases (Tries +m first to try to finish game quickly)
        return solveWin(leap, game, i+leap) 
               || solveWin(leap, game, i+1) 
               || solveWin(leap, game, i-1);
    }

    public static void main(String[] args) {
        Scanner scan = new Scanner(System.in);
        int q = scan.nextInt();
        while (q-- > 0) {
            int n = scan.nextInt();
            int leap = scan.nextInt();
            
            int[] game = new int[n];
            for (int i = 0; i < n; i++) {
                game[i] = scan.nextInt();
            }

            System.out.println( (canWin(leap, game)) ? "YES" : "NO" );
        }
        scan.close();
    }
}