## Number of substrings that start with “geeks” and end with “for”

Given a string str consisting of lowercase English alphabets, the task is to find the count of substrings that start with “geeks” and end with… Read More »

- Count substrings that contain all vowels | SET 2
- Minimum number of times A has to be repeated such that B is a substring of it
- Largest substring with same Characters
- Count of substrings which contains a given character K times
- Maximum length palindromic substring such that it starts and ends with given char
- Queries to check if string B exists as substring in string A
- Find distinct characters in distinct substrings of a string
- Count number of distinct substrings of a given length
- Maximum number of given operations to remove the entire string
- Queries to find the first non-repeating character in the sub-string of a string
- Maximum String Partition
- Number of substrings that start with "geeks" and end with "for"
- Number of balanced parenthesis substrings
- Queries to find the last non-repeating character in the sub-string of a given string
- Count number of substrings of a string consisting of same characters
- Count all substrings having character K
- Count of non-overlapping sub-strings "101" and "010" in the given binary string
- Frequency of a substring in a string using pthread
- Rearrange given string to maximize the occurrence of string t
- Longest sub string of 0's in a binary string which is repeated K times
- Minimum number of substrings the given string can be splitted into that satisfy the given conditions
- Check if string can be rearranged so that every Odd length Substring is Palindrome
- Reverse the given string in the range [L, R]
- Check if a string contains two non overlapping sub-strings "geek" and "keeg"
- Count of three non-overlapping sub-strings which on concatenation forms a palindrome
- Repeat substrings of the given String required number of times
- Count number of binary strings such that there is no substring of length greater than or equal to 3 with all 1's
- Largest substring of str2 which is a prefix of str1
- Longest substring such that no three consecutive characters are same
- Largest sub-string where all the characters appear at least K times

Given a string str consisting of lowercase English alphabets, the task is to find the count of substrings that start with “geeks” and end with… Read More »

Given a string. The task is to find the maximum number P, such that given string can be partitioned into P contiguous substrings such that… Read More »

Given an input string and a substring. Find the frequency of occurrences of a substring in the given string using pthreads. Examples: Input: string =… Read More »

Given a string str, the task is to repeat every substring of the string X number of times where X is the number composed of… Read More »

Given a string s of size N. The task is to find the largest substring which consists of same characters Examples: Input : s =… Read More »

Given a string str containing lowercase English characters, we can perform the following two operations on the given string: Remove the entire string. Remove a… Read More »

Given two strings A and B. The task is to find the minimum number of times A has to be repeated such that B is… Read More »

Given a balanced parenthesis string which consists of ‘(‘ and ‘)‘. The task is to find the number of balanced parenthesis substrings in the given… Read More »

Given binary string S of size N and a number K. The task is to find the Longest sub string of 0’s in the string… Read More »

Given a string str and a character ch, the task is to find the longest palindromic sub-string of str such that it starts and ends… Read More »

Given a binary string str, the task is to find the count of non-overlapping sub-strings of either the form “010” or “101”. Examples: Input: str… Read More »

Given a string str, the task is to find the count of distinct characters in all the distinct sub-strings of the given string. Examples: Input:… Read More »

Given a string str containing lowercase alphabets, the task is to count the sub-strings that contain all the vowels at-least one time and there are… Read More »

Given a string consisting of numerical alphabets, a character C and an integer K, the task is to find the number of possible substrings which… Read More »

Given a string str and an integer K, the task is to find the length of the longest sub-string S’ such that every character in… Read More »