We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Java
  3. Data Structures
  4. Java 1D Array (Part 2)
  5. Discussions

Java 1D Array (Part 2)

  • RodneyShag
     + 2 comments

    Hi. At each spot in the array, we have 3 options. The code tries all 3 paths for each spot in the array. If any of them lead to a solution, we return true, otherwise, false.

    isSolvable(array, m, i + m)

    tries to take m steps right.

    isSolvable(array, m, i + 1)

    tries to take 1 step right.

    isSolvable(array, m, i - 1)

    tries to take 1 step left.

    HackerRank solutions.