## Maximum repeated frequency of characters in a given string

Given a string S, the task is to find the count of maximum repeated frequency of characters in the given string S. Examples: Input: S… Read More »

- Check duplicates in a stream of strings
- Minimum number of substrings the given string can be splitted into that satisfy the given conditions
- Minimum cost to convert str1 to str2 with the given operations
- Modulo of a large Binary String
- Count number of binary strings such that there is no substring of length greater than or equal to 3 with all 1's
- Print characters in decreasing order of frequency
- Minimum number of additons to make the string balanced
- Minimum characters that are to be inserted such that no three consecutive characters are same
- Minimum length String with Sum of the alphabetical values of the characters equal to N
- Check whether two strings can be made equal by copying their characters with the adjacent ones
- Extract all integers from the given string in Java
- Count of matchsticks required to represent the given number
- C Program to concatenate two strings without using strcat
- Program to implement FLAMES game
- C program to print the length of a String using %n format specifier

Given a string S, the task is to find the count of maximum repeated frequency of characters in the given string S. Examples: Input: S… Read More »

Given a list of strings arr[] of zeros and ones only and two integer N and M, where N is the number of 1’s and… Read More »

Given two Binary string A and B of length N, the task is to find the Binary string whose Hamming Distance to strings A and… Read More »

Given a string S and two integer N and K, the task is to find the maximum length suffix such that occurrence of each character… Read More »

Given a string S, the task is to find the prefix of string S with the maximum possible length such that frequency of each character… Read More »

Given a string str, the task is to find the longest palindromic string that can be obtained from it after removing a substring. Examples: Input:… Read More »

Given two integers N and K, the task is find the lexicographically Kth largest string of size N from the set of strings containing only… Read More »

Given a string str consisting of lowercase characters, the task is to find the total numbers of unique substrings with non-repeating characters. Examples: Input: str… Read More »

Given a number in the form of a string s, the task is to calculate and display minimum splits required such that the segments formed… Read More »

Given an integer N, the task is to find the smallest and largest N-digit numbers in Octal Number System. Examples: Input: N = 4 Output:… Read More »

Given an array arr[] of N strings, the task is to sort these strings according to the numbers of vowels in them. Examples: Input: arr[]… Read More »

Given an array of strings arr[], the task is to sort the array of strings according to frequency of each string, in ascending order. If… Read More »

Given an integer K and a binary string S of length N, the task is to find out the number of substrings whose decimal equivalent… Read More »

Given a String str, the task is to check the sum of ASCII values of all characters in this string is a perfect cube or… Read More »

Given a string str, the task is to find the XOR of ASCII values of characters in the string. Examples: Input: str = “Geeks” Output:… Read More »