Skip to content
Related Articles

Related Articles

Table of Contents

Improve Article
Save Article
Like Article

Longest Substring containing ‘1’

  • Last Updated : 16 Aug, 2021

Given a binary string, the task is to print the length of the longest substring containing only ‘1’.

Examples:

Input: 110
Output: 2
Explanation: Length of the longest substring containing only ‘1’ is “11”.

Input: 11101110
Output: 3

Approach: Traverse the string and count the number of contiguous 1‘s encountered. Store the maximum number of contiguous 1s in a variable, say max. Finally, print the value of max obtained.

Below is the implementation of the above approach:

C++




// C++ program for the above approach
 
#include <bits/stdc++.h>
using namespace std;
 
// Function to find length of
// longest substring containing '1'
int maxlength(string s)
{
    int n = s.length(), i, j;
    int ans = 0;
    for (i = 0; i <= n - 1; i++) {
 
        // Count the number of contiguous 1's
        if (s[i] == '1') {
 
            int count = 1;
            for (j = i + 1; j <= n - 1
                            && s[j] == '1';
                 j++)
                count++;
            ans = max(ans, count);
        }
    }
    return ans;
}
 
// Driver Code
int main()
{
    string s = "11101110";
 
    cout << maxlength(s) << endl;
    return 0;
}
Java



// Java program to find length
// of longest substring containing '1'
 
class GFG {
 
    // Function to find length of
    // of longest substring containing '1'
    static int maxlength(String s)
    {
        int n = s.length(), i, j;
        int ans = 0;
        for (i = 0; i <= n - 1; i++) {
 
            // Count the number of contiguous 1's
            if (s.charAt(i) == '1') {
 
                int count = 1;
                for (j = i + 1;
                     j <= n - 1 && s.charAt(j) == '1'; j++)
                    count++;
                ans = Math.max(ans, count);
            }
        }
        return ans;
    }
 
    public static void main(String[] args)
    {
        String s = "11101110";
 
        System.out.println(
            "Length of longest substring containing '1' = "
            + maxlength(s));
    }
}
Python3



# Python program for the above approach
 
# Function to find length of
# longest substring containing '1'
def maxlength(s):
    n = len(s)
    ans = 0;
    for i in range(n):
         
        # Count the number of contiguous 1's
        if (s[i] == '1'):
            count = 1
            j = i + 1
            while(j <= n - 1 and s[j] == '1'):
                count += 1
                j += 1
            ans = max(ans, count)
    return ans
 
# Driver Code
s = "11101110";
print(maxlength(s))
 
# This code is contributed by Shivani
C#



// C# program for the above approach
using System;
 
class GFG{
 
// Function to find length of
// of longest substring containing '1'
static int maxlength(String s)
{
    int n = s.Length, i, j;
    int ans = 0;
     
    for(i = 0; i <= n - 1; i++)
    {
         
        // Count the number of contiguous 1's
        if (s[i] == '1')
        {
            int count = 1;
            for(j = i + 1;
                j <= n - 1 && s[j] == '1';
                j++)
                count++;
                 
            ans = Math.Max(ans, count);
        }
    }
    return ans;
}
 
// Driver code
public static void Main(String[] args)
{
    String s = "11101110";
 
    Console.Write(maxlength(s));
}
}
 
// This code is contributed by shivanisinghss2110
Javascript



<script>
 
        // JavaScript program for the above approach;
 
        // Function to find length of
        // longest substring containing '1'
        function maxlength(s)
        {
            let n = s.length, i, j;
            let ans = 0;
            for (i = 0; i <= n - 1; i++) {
 
                // Count the number of contiguous 1's
                if (s[i] == '1') {
 
                    let count = 1;
                    for (j = i + 1; j <= n - 1
                        && s[j] == '1';
                        j++)
                        count++;
                    ans = Math.max(ans, count);
                }
            }
            return ans;
        }
 
        // Driver Code
        let s = "11101110";
        document.write(maxlength(s));
 
// This code is contributed by Potta Lokesh
    </script>
Output: 
3
 
Time Complexity: O(N2)
Auxiliary Space: O(1)
 

My Personal Notes
arrow_drop_up
Previous
Count of distinct N-digit odd integers that can be generated using given set of digits
Next

Minimum number of characters required to be added to a String such that all lowercase alphabets occurs as a subsequence in increasing order
Recommended Articles
Page :
Longest substring containing exactly K vowels
16, Dec 21
Lexicographically smallest substring with maximum occurrences containing a's and b's only
28, Nov 18
Lexicographically smallest K-length substring containing maximum number of vowels
05, Jun 20
Lexicographic smallest permutation of a String containing the second String as a Substring
20, Aug 20
Count of substrings of a string containing another given string as a substring
03, Dec 20
Count of substrings of a string containing another given string as a substring | Set 2
14, Dec 20
Lexicographically smallest and largest anagrams of a string containing another string as its substring
10, Sep 20
Shortest substring of a string containing all given words
11, Oct 17
Count of K length substring containing at most X distinct vowels
21, Dec 21
Length of longest common subsequence containing vowels
22, Sep 18
Longest Subsequence of a String containing only vowels
03, Apr 20
Longest Subsequence of a String containing only Consonants
07, May 20
Partition given string in such manner that i'th substring is sum of (i-1)'th and (i-2)'th substring
15, Feb 18
Length of the largest substring which have character with frequency greater than or equal to half of the substring
29, May 19
Minimum removals to make a string concatenation of a substring of 0s followed by a substring of 1s
14, Dec 20
Minimum length of substring whose rotation generates a palindromic substring
21, May 20
Check if a string can be split into two substrings such that one substring is a substring of the other
23, Dec 20
Count occurrences of substring X before every occurrence of substring Y in a given string
16, May 21
Minimize replacement of bits to make the count of 01 substring equal to 10 substring
22, Dec 21
Check if substring S1 appear after any occurrence of substring S2 in given sentence
05, Jan 22
Find if a given string can be represented from a substring by iterating the substring “n” times
12, Jan 15
Longest Non-palindromic substring
09, May 17
Manacher's Algorithm - Linear Time Longest Palindromic Substring - Part 1
16, Dec 14
Manacher's Algorithm - Linear Time Longest Palindromic Substring - Part 2
16, Dec 14
Article Contributed By :
https://media.geeksforgeeks.org/auth/avatar.png
rajsanghavi9
@rajsanghavi9
Vote for difficulty





Improved By :
Article Tags :
Practice Tags :
Report Issue

We use cookies to ensure you have the best browsing experience on our website. By using our site, you
acknowledge that you have read and understood our
Cookie Policy &
        Privacy Policy

Lightbox

Start Your Coding Journey Now!