Skip to content
Related Articles

Related Articles

Table of Contents

Improve Article
Save Article
Like Article

Length of longest substring having all characters as K

  • Last Updated : 01 Jun, 2021

Given a string S and a character K. The task is to find the length of the longest substring of S having all characters the same as character K.

Examples: 

Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.  To complete your preparation from learning a language to DS Algo and many more,  please refer Complete Interview Preparation Course.

In case you wish to attend live classes with experts, please refer DSA Live Classes for Working Professionals and Competitive Programming Live for Students.

Input: S = “abcd1111aabc”, K = ‘1’ 
Output: 4 
Explanation: 
1111 is the largest substring of length 4.



Input: S = “#1234#@@abcd”, K = ‘@’ 
Output: 2 
Explanation: 
@@ is the largest substring of length 2.

Approach: The idea is to iterate over the string and check the following two conditions:

  • If the current character is the same as character K then increase the value of the counter by one.
  • If the current character is not the same as K then update the previous count and reinitialize the counter to 0.
  • Repeat the steps above till the length of the string.

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 the length of
// longest sub-string having all
// characters same as character K
int length_substring(string S, char K)
{
    // Initialize variables
    int curr_cnt = 0, prev_cnt = 0, max_len;
 
    // Iterate till size of string
    for (int i = 0; i < S.size(); i++) {
 
        // Check if current character is K
        if (S[i] == K) {
            curr_cnt += 1;
        }
 
        else {
            prev_cnt = max(prev_cnt, curr_cnt);
            curr_cnt = 0;
        }
    }
 
    prev_cnt = max(prev_cnt, curr_cnt);
 
    // Assingning the max
    // value to max_len
    max_len = prev_cnt;
 
    return max_len;
}
 
// Driver code
int main()
{
    string S = "abcd1111aabc";
    char K = '1';
 
    // Function call
    cout << length_substring(S, K);
    return 0;
}
Java



// Java program for
// the above approach
import java.util.*;
class GFG {
 
// Function to find the length of
// longest sub-string having all
// characters same as character K
static int length_substring(String S,
                            char K)
{
  // Initialize variables
  int curr_cnt = 0, prev_cnt = 0,
      max_len;
 
  // Iterate till size of string
  for (int i = 0; i < S.length(); i++)
  {
    // Check if current character is K
    if (S.charAt(i) == K)
    {
      curr_cnt += 1;
    }
    else
    {
      prev_cnt = Math.max(prev_cnt,
                          curr_cnt);
      curr_cnt = 0;
    }
  }
 
  prev_cnt = Math.max(prev_cnt,
                      curr_cnt);
 
  // Assingning the max
  // value to max_len
  max_len = prev_cnt;
 
  return max_len;
}
 
// Driver code
public static void main(String[] args)
{
  String S = "abcd1111aabc";
  char K = '1';
 
  // Function call
  System.out.print(length_substring(S, K));
}
}
 
// This code is contributed by Chitranayal
Python3



# Python3 program for the above approach
 
# Function to find the length of
# longest sub-string having all
# characters same as character K
def length_substring(S, K):
     
    # Initialize variables
    curr_cnt = 0
    prev_cnt = 0
    max_len = 0
 
    # Iterate till size of string
    for i in range(len(S)):
 
        # Check if current character is K
        if (S[i] == K):
            curr_cnt += 1
        else:
            prev_cnt = max(prev_cnt,
                           curr_cnt)
            curr_cnt = 0
 
    prev_cnt = max(prev_cnt, curr_cnt)
 
    # Assingning the max
    # value to max_len
    max_len = prev_cnt
 
    return max_len
 
# Driver code
if __name__ == '__main__':
     
    S = "abcd1111aabc"
    K = '1'
 
    # Function call
    print(length_substring(S, K))
 
# This code is contributed by mohit kumar 29
C#



// C# program for the above approach
using System;
 
class GFG{
 
// Function to find the length of
// longest sub-string having all
// characters same as character K
static int length_substring(string S, char K)
{
     
    // Initialize variables
    int curr_cnt = 0, prev_cnt = 0, max_len;
     
    // Iterate till size of string
    for(int i = 0; i < S.Length; i++)
    {
         
        // Check if current character is K
        if (S[i] == K)
        {
            curr_cnt += 1;
        }
        else
        {
            prev_cnt = Math.Max(prev_cnt,
                                curr_cnt);
            curr_cnt = 0;
        }
    }
    prev_cnt = Math.Max(prev_cnt, curr_cnt);
     
    // Assingning the max
    // value to max_len
    max_len = prev_cnt;
    return max_len;
}
 
// Driver code
static public void Main()
{
    string S = "abcd1111aabc";
    char K = '1';
     
    // Function call
    Console.WriteLine(length_substring(S, K));
}
}
 
// This code is contributed by rag2127
Javascript



<script>
 
// Javascript program for
// the above approach
 
// Function to find the length of
// longest sub-string having all
// characters same as character K
function length_substring(S, K)
{
     
    // Initialize variables
    let curr_cnt = 0, prev_cnt = 0,
    max_len;
     
    // Iterate till size of string
    for(let i = 0; i < S.length; i++)
    {
         
        // Check if current character is K
        if (S[i] == K)
        {
            curr_cnt += 1;
        }
        else
        {
            prev_cnt = Math.max(prev_cnt,
                                curr_cnt);
            curr_cnt = 0;
        }
    }
     
    prev_cnt = Math.max(prev_cnt,
                        curr_cnt);
     
    // Assingning the max
    // value to max_len
    max_len = prev_cnt;
     
    return max_len;
}
 
// Driver code
let S = "abcd1111aabc";
let K = '1';
 
// Function call
document.write(length_substring(S, K));
 
// This code is contributed by avanitrachhadiya2155
 
</script>
Output: 
4
Time Complexity: O(N) 
Auxiliary Space: O(1)



My Personal Notes
arrow_drop_up
Previous
Golang Pointer to an Array as Function Argument
Next

White and black dot detection using OpenCV | Python
Recommended Articles
Page :
Generate an N-length string having longest palindromic substring of length K
14, Dec 20
Maximum length substring having all same characters after k changes
12, Jul 17
Longest substring with atmost K characters from the given set of characters
30, Apr 20
Length of the longest substring without repeating characters
02, Dec 11
Find length of longest substring with at most K normal characters
26, Apr 20
Modify string by inserting characters such that every K-length substring consists of unique characters only
14, Feb 21
Check if a K-length substring exists having only 2 distinct characters, each with frequency greater than K/3
30, Nov 21
Longest substring where all the characters appear at least K times | Set 3
10, Feb 21
Length of longest Palindromic Subsequence of even length with no two adjacent characters same
04, Feb 20
Maximum length of a substring required to be flipped repeatedly to make all characters of binary string equal to 0
05, Aug 21
Length of the largest substring which have character with frequency greater than or equal to half of the substring
29, May 19
Minimum length of substring whose rotation generates a palindromic substring
21, May 20
Find the longest substring with k unique characters in a given string
18, Mar 15
Print Longest substring without repeating characters
30, May 18
Longest substring of only 4's from the first N characters of the infinite string
18, Apr 19
Longest substring such that no three consecutive characters are same
17, Sep 19
Longest substring whose characters can be rearranged to form a Palindrome
15, Aug 20
Longest substring between any pair of occurrences ōf similar characters
20, Oct 20
Longest substring with no pair of adjacent characters are adjacent English alphabets
10, Feb 21
Longest substring with K unique characters using Binary Search
27, Dec 19
Longest Substring that can be made a palindrome by swapping of characters
25, Dec 20
Longest substring having K distinct vowels
05, May 18
Longest Substring having equal count of Vowels and Consonants
19, Aug 20
Find the String having each substring with exactly K distinct characters
26, Apr 20
Article Contributed By :
https://media.geeksforgeeks.org/auth/avatar.png
charlie_04
@charlie_04
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!