Hackerrank Java 1D Array (Part 2)

[biryu2205]

import java.util.Scanner;

public class Solution {
  public static void main(String[] args) {
    Scanner scan = new Scanner(System.in);
    int T = scan.nextInt();
    while (T-- > 0) {
      int n = scan.nextInt();
      int m = scan.nextInt();
      int[] array = new int[n];
      for (int i = 0; i < n; i++) {
        array[i] = scan.nextInt();
      }
      System.out.println(isSolvable(array, m, 0) ? "YES" : "NO");
    }
    scan.close();
  }

  private static boolean isSolvable(int[] array, int m, int i) {
    if (i < 0 || array[i] == 1) {
      return false;
    } else if (i + 1 >= array.length || i + m >= array.length) {
      return true;
    }

    array[i] = 1;
    return isSolvable(array, m, i + m) ||
        isSolvable(array, m, i + 1) ||
        isSolvable(array, m, i - 1);
  }
}