Interview Question and Answer – 3

By | October 1, 2018


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 or . 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 if they are safe or if they must be avoided. For example, indexed from . The number on each cloud is its index in the list so she must avoid the clouds at indexes and . She could follow the following two paths: or . The first path takes jumps while the second takes .

Function Description

Complete the jumpingOnClouds function in the editor below. It should return the minimum number of jumps required, as an integer.

jumpingOnClouds has the following parameter(s):

c: an array of binary integers

Input Format

The first line contains an integer , the total number of clouds. The second line contains space-separated binary integers describing clouds where .


Output Format

Print the minimum number of jumps needed to win the game.

Sample Input 0

0 0 1 0 0 1 0

Sample Output 0



Emma must avoid and . She can win the game with a minimum of jumps:


Sample Input 1

0 0 0 0 1 0
Sample Output 1



static int jumpingOnClouds(int[] c){
        ArrayList<Integer> path = new ArrayList<>();

        for (int i = 1; i < c.length; i++) {
            if (c[i] == 0) {
               int last1Index = path.get(path.size() - 1); // 1
                if (path.size() == 1) {
                int last2Index = path.get(path.size() - 2); 
                if(last1Index - last2Index  == 1 && i - last1Index == 1) {
                    path.set(path.size() - 1, i);
                }else {
        return path.size() - 1;


Leave a Reply

Your email address will not be published. Required fields are marked *