Skip to main content

Java 1D Array (Part 2) HackerRank Soution with Explanation | Programming Tutorial

Java 1D Array (Part 2) HackerRank Soution with Explanation | Programming Tutorial

Problem Description :-

Let's play a game on an array! You're standing at index 0 of an n-element array names game. From some index i (Where 0 <= i < n), you can perform one of the following moves:

  • Move Backward: If cell i-1 exists and contains a 0, you can walk back to cell i-1.
  • Move Forward: 
    • If cell i + 1 contains a zero, you can walk to cell i + 1.
    • If cell i + leap contains a zero, you can jump to cell i + leap.
    • If you're standing in cell n - 1 or the value of i + leap >= n, you can walk or jump off the end of the array and win the game.

In other words, you can move from index i to index i + 1, i - 1 or i + leap as long as the destination index is a cell containing a 0, If the destination index is greater than n - 1, you win the game.

Given leap and game, complete the function in the editor below so that it returns true if you can win the game (or false if you cannot).

Read Description on HackerRank :-

Lets see solution of problem.

Solution 1 :- Using Stack Data Structure

import java.util.*;

public class Solution {

    public static boolean canWin(int leap, int[] game) {
        int arrayLength = game.length;

        Stack<Integer> stack = new Stack<>();
        stack.push(0);

        while (!stack.isEmpty()) {
            int i = stack.pop();

            if (i >= arrayLength) return true;

            if (i < 0 || game[i] == 1) continue;

            game[i] = 1;

            stack.push(i+1);
            stack.push(i-1);
            stack.push(i+leap);
        }
        return false;
    }

    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();
    }
}

Output :-

5 3
0 0 0 0 0
YES

-----------

6 3
0 0 1 1 1 0
NO

Explanation :-

  • ArrayLength = 6, leap = 3, game = [0 0 1 1 1 0]
  • Defined stack data structure. push 0 value into stack for initial.
  • While loop until stack is not empty.
    • Get first value from stack using pop operation. value = 0.
    • i >= arrayLength, 0 >= 6, No.
    • i < 0 || game[0] == 1, 0 < 0 || 0 == 1, No,
    • game[i] = 1, set 1 to 0th index in game array, [1 0 1 1 1 0].
    • Push i + 1 in stack, 0 + 1 = 1.
    • Push i - 1 in stack, 0 - 1 = -1.
    • Push i + leap in stack, 0 + 3 = 3.
  • Stack = [1 -1 3], game = [1 0 1 1 1 0].
  • Stack is not empty.
    • Pop 3.
    • i >= arrayLength, 3 >= 6, No.
    • i < 0 || game[3] == 1, 3 < 0 || 1 == 1, Yes, Continue.
  •  Stack is not empty.
    • Pop -1.
    • i >= arrayLength, -1 >= 6, No.
    • i < 0 || game[-1] == 1, -1 < 0 , Yes, Continue.
  •  Stack is not empty.
    • Pop 1.
    • i >= arrayLength, 1 >= 6, No.
    • i < 0 || game[1] == 1, 1 < 0 || 0 == 1, No.
    • game[i] = 1, set 1 to 0th index in game array, [1 1 1 1 1 0].
    • Push i + 1 in stack, 1 + 1 = 2.
    • Push i - 1 in stack, 1 - 1 = 0.
    • Push i + leap in stack, 1 + 3 = 4. 
  • Stack = [2 0 4], game = [1 1 1 1 1 0].
  • Stack is not empty.
    • Pop 4.
    • i >= arrayLength, 4 >= 6, No.
    • i < 0 || game[1] == 1, 4 < 0 || 1 == 1, Yes, Continue.
  •  Stack is not empty.
    • Pop 0.
    • i >= arrayLength, 1 >= 6, No.
    • i < 0 || game[-1] == 1, 1 < 0 , 1 == 1 Yes, Continue
  •  Stack is not empty.
    • Pop 2.
    • i >= arrayLength, 2 >= 6, No.
    • i < 0 || game[-1] == 1, 2 < 0 , 1 == 1 Yes, Continue
  • Stack is empty
  • Return false and print NO.

Solution 2 :- Using Recursive Approach

import java.util.*;

public class Solution {

    public static boolean canWin(int leap, int[] game, int i) {
        // Return true if you can win the game; otherwise, return false.
        
        if (i >= game.length) {
            return true;
        } else if (i < 0 || game[i] == 1) {
            return false;
        }
                
        game[i] = 1; 

        return canWin(leap, game, i + leap) ||  canWin(leap, game, i + 1) || canWin(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, 0)) ? "YES" : "NO" );
        }
        scan.close();
    }
}


Happy Coding.

Other HackerRank Problems and solutions in Java :-

Comments

Post a Comment

Popular posts from this blog

Flipping the Matrix HackerRank Solution in Java with Explanation

Java Solution for Flipping the Matrix | Find Highest Sum of Upper-Left Quadrant of Matrix Problem Description : Sean invented a game involving a 2n * 2n matrix where each cell of the matrix contains an integer. He can reverse any of its rows or columns any number of times. The goal of the game is to maximize the sum of the elements in the n *n submatrix located in the upper-left quadrant of the matrix. Given the initial configurations for q matrices, help Sean reverse the rows and columns of each matrix in the best possible way so that the sum of the elements in the matrix's upper-left quadrant is maximal.  Input : matrix = [[1, 2], [3, 4]] Output : 4 Input : matrix = [[112, 42, 83, 119], [56, 125, 56, 49], [15, 78, 101, 43], [62, 98, 114, 108]] Output : 119 + 114 + 56 + 125 = 414 Full Problem Description : Flipping the Matrix Problem Description   Here we can find solution using following pattern, So simply we have to find Max of same number of box like (1,1,1,1). And ...
Post a Comment
Read more

How to Implement One to Many and Many to One Mapping in Spring Boot using JPA

Spring Boot CRUD example using One-to-Many and Many to One mapping | With Thymeleaf User Interface In this tutorial, we will learn how to use @OneToMany and @ManyToOne annotation using JPA (Java Persistent API) in Spring Boot. We also attach Thymeleaf for User Interface. In past tutorial, we already created Spring Boot CRUD with Rest API, JPA and MySql. Please refer that one first, we will continue from there. Spring Boot application with Thymeleaf, Rest API, JPA and MySql Database    For applying One to Many relationship, we need another POJO class. In past we already created Book class, now we will create new class Author . As we know Author have multiple Books, so we can easily apply One to Many operation. Lets create POJO class for Author and apply @OneToMany on Book .  Define List of Book and apply @OneToMany annotation on field. We are using mappedBy property, so Author table does not create new column.  We already learn about mappedBy property in One-to-One a...
Post a Comment
Read more