HackerRank Çözümleri – Jumping on the Clouds

HackerRank içerisinde bulunan “Jumping on the Clouds” sorusunun açıklaması ve çözümü. Bu soruda size verilen bulutlar, ve bunların hangilerinin üzerinden zıplayıp zıplayamayacağınız bilgisi veriliyor. Bir seferde 1 veya 2 bulut zıplayabiliyorsunuz. İlk buluttan son buluta kaç zıplamada gidebilirsiniz?

► HackerRank – Jumping on the Clouds: https://www.hackerrank.com/challenges/jumping-on-the-clouds/problem

► Problem açıklaması:

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

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


c = [0, 1, 0, 0, 0, 1, 0]

Index the array from 0…6. The number on each cloud is its index in the list so the player must avoid the clouds at indices 1 and 5. They could follow these two paths: 0-2-4-6 or 0-2-3-4-6. The first path takes 3 jumps while the second takes 4. Return 3.

Function Description

Complete the jumpingOnClouds function in the editor below. jumpingOnClouds has the following parameter(s):

– int c[n]: an array of binary integers


– int: the minimum number of jumps required

Leave a Reply

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

This site uses Akismet to reduce spam. Learn how your comment data is processed.