Power jumper program in python cognizant

View Discussion

Improve Article

Save Article

View Discussion

Improve Article

Save Article

Given a string consisting of 1 and 0, the task is to find out the maximum power of jump required to reach the end of the string. At a time you can jump from one 1 to next 1 or from one 0 to next 0. 

Note: Power of jump is defined as the distance between two consecutive 1’s or two consecutive 0’s.

Examples: 

Input: 10101
Output: 2
First, make a power jump of 1 to reach first 1, 
then a power jump of 2 to reach second 1
and then finally a power jump of 2 
to reach the end of the string
hence the maximum power of jump is 2.

Input: 11110
Output: 5
Since to reach the end of the string, we have to make
power jump of 5 to reach 0 and end of the string

Approach: 

• Check if the last character of given string is 1 or 0.
• If the last character is 1 then search for the first 1 in the string and continue to jump to the next 1 to reach the last of the string. Update the maximum jumps.
• Similarly, if the last character is 0 then search for the first 0 in the string and continue to jump to the next 0 to reach the last of the string. Update the maximum jumps.
• Return the maximum number of jumps taken to reach the end.

Implementation:

C++

#include

using namespace std;

int powerOfJump(string s)

{

    int count = 1;

    int max_so_far = INT_MIN;

    char ch = s[s.length() - 1];

    for (int i = 0; i < s.length(); i++)

    {

        if (s[i] == ch)

        {

            if (count > max_so_far) {

                max_so_far = count;

            }

            count = 1;

        }

        else

        count++;

    }

    return max_so_far;

}

int main(){

    string st = "1010101";

    cout<

}

Java

import java.util.ArrayList;

public class string_sort {

    public static int powerOfJump(String s)

    {

        int count = 1;

        int max_so_far = Integer.MIN_VALUE;

        char ch = s.charAt(s.length() - 1);

        for (int i = 0; i < s.length(); i++) {

            if (s.charAt(i) == ch) {

                if (count > max_so_far) {

                    max_so_far = count;

                }

                count = 1;

            }

            else

                count++;

        }

        return max_so_far;

    }

    public static void main(String[] args)

    {

        String st = "1010101";

        System.out.println(powerOfJump(st));

    }