Jumping on the Clouds HackerRank Java Solution

Jumping on the Clouds HackerRank Java Solution | Programming Blog

 

Emma is playing a new mobile game that starts with consecutively numbered clouds. Some of the clouds are thunderheads and others are cumulus. She can jump on any cumulus cloud having a number that is equal to the number of the current cloud plus 1 or 2. She must avoid the thunderheads. Determine the minimum number of jumps it will take Emma to jump from her starting postion to the last cloud. It is always possible to win the game. 

For each game, Emma will get an array of clouds numbered 0 if they are safe or 1 if they must be avoided. For example, 

c = [0, 1, 0 , 0 ,0, 1, 0] indexed from 0...6. The number on each cloud is its index in the list so she must avoid the clouds at indexes 1 and 5. 

She could follow the following two paths:
0 -> 2 -> 4 -> 6 or 0 -> 2 -> 3 -> 4 -> 6. The first path takes 3 jumps while the second takes 4.

Here is the link for Hacker Rank problem :

• Hacker Rank Jumping on the Clouds Problem Description 

Lets see solution of this problem

Solution 1 :- Using For Loop

import java.util.Scanner;

public class JumpingOnTheClouds {

    public static void main(String[] args) {
        
        Scanner sc = new Scanner(System.in);
        System.out.println("Enter the total number of cloud");
        int totalPath = sc.nextInt();
        int[] array = new int[totalPath];
        
        System.out.println("Enter Values of clouds");
        for (int i = 0; i < array.length; i++) {
            array[i] = sc.nextInt();
        }
        
        int jumps = 0;
        
        // Loop until arrays length
        for (int i = 0; i < array.length - 1; i++) {
            
            // Check i+1 cloud, if its exist and value is 0 then
            // jump into that
            if ((i+2) < array.length && array[i+2] == 0) {
                ++i;
                jumps++;
            
            // Check i+1 cloud, if it exist then jump into that
            } else if ((i+1) < array.length) {
                if (array[i+1] == 0) {
                    jumps++;
                }
            }
        }

        System.out.println("Minimum jumps required to win game : " +jumps);
    }

}
 

Output :-
Enter the total number of cloud
7
Enter Values of clouds
0 0 1 0 0 1 0
Minimum jumps required to win game : 4
__________________________________

Enter the total number of cloud
6
Enter Values of clouds
0 0 0 0 1 0
Minimum jumps required to win game : 3

Solution 2 :- Using While Loop

import java.util.Scanner;

public class JumpingOnTheClouds {

    public static void main(String[] args) {
       
        Scanner sc = new Scanner(System.in);
        System.out.println("Enter the total number of cloud");
        int totalPath = sc.nextInt();
        int[] array = new int[totalPath];
       
        System.out.println("Enter Values of clouds");
        for (int i = 0; i < array.length; i++) {
            array[i] = sc.nextInt();
        }
       
        int jumps = 0;
        int i = 0;
        while(i < totalPath-1) {
            if (i < totalPath-2 && array[i+2]==0) {
                i++;
            }
            if(i != totalPath - 1) {
                jumps++;
            }
            i++;
        }
        System.out.println("Minimum jumps required to win game : " + jumps);
    }

}

Output :-
Enter the total number of cloud
7
Enter Values of clouds
0 0 1 0 0 1 0
Minimum jumps required to win game : 4
__________________________________

Enter the total number of cloud
6
Enter Values of clouds
0 0 0 0 1 0
Minimum jumps required to win game : 3

If you have any query related to above problem then comment down. I am happy to resolve it.

Check out other HackerRank problem's solution in Java :-

• Two Dimension DS Problem Solution in Java
• Repeated String HackerRank Solution 
• Sales by Match HackerRank Solution 
• Counting Valleys HackerRank Solution 

 

                                                                    Thank You