## Split a given string into substrings of length K with equal sum of ASCII values

Given a string str of size N and an integer K, the task is to check if the input string can be partitioned into substrings… Read More »

- Split the given string into Primes : Digit DP
- Print all possible combinations of the string by replacing '$' with any other digit from the string
- Check if a string is a scrambled form of another string
- Check if given words are present in a string
- Count the number of ways to construct the target string
- Kth most frequent Character in a given String
- Sort a string according to the frequency of characters
- Count of substrings of length K with exactly K distinct characters
- Program to reverse words in a given string in C++
- Find lexicographically smallest string in at most one swaps
- What is a Webcrawler and where is it used?
- Check if given Parentheses expression is balanced or not
- CamelCase Pattern Matching
- Justify the given Text based on the given width of each line
- Digital Root of a given large integer using Recursion
- Length of the smallest substring which contains all vowels
- Count ways to partition a string such that both parts have equal distinct characters
- Shortest Palindromic Substring
- Java program to print Even length words in a String
- Remove odd frequency characters from the string
- Count minimum swap to make string palindrome
- Check if the given string is shuffled substring of another string
- Sort the strings based on the numbers of matchsticks required to represent them
- Calculate the frequency of each word in the given string
- Move all occurence of letter 'x' from the string s to the end using Recursion
- Longest Palindrome in a String formed by concatenating its prefix and suffix
- Sort an array of Strings according frequency
- Convert Character Array To String In Java
- Bitwise XOR of a Binary array
- Processing strings using std::istringstream

Given a string str of size N and an integer K, the task is to check if the input string can be partitioned into substrings… Read More »

Given a string str of size N, the task is to print the number of substrings formed after maximum possible partitions such that no two… Read More »

Given a string txt, the task is to find the index of currency symbols present in the given string. Examples: Input: txt = “Currency symbol… Read More »

Given a binary string str of size N and a positive integer K, the task is to find the minimum number of flips required to… Read More »

Given N lists of strings, the task is to find the count of lists which are not a sublist of any other given lists. Examples:… Read More »

Given two integer N and K, the task is to find the size of the smallest string that contains all permutations of length N that can… Read More »

Given a large number in form of string str of size N, the task is to count the subsequence of length 4 whose digit are… Read More »

Given two strings S and T and a number K, the task is to count the number of ways to convert string S to string… Read More »

Given a string str of lowercase English alphabets, our task is to find the frequency of occurrence a subsequence of the string which occurs the… 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 »

Given two arrays arr1[] and arr2[] consisting of strings, the task is to print the count of anagrams of every string in arr2[] that are… Read More »

Given a string S, print those permutations of string S which are lexicographically greater than S. If there is no such permutation of string, print… Read More »

Problem Statement: Design a Definite Finite Automata for accepting the permutation of Three a’s and Three b’s over the input {a, b} Input: S =… Read More »

Given a string str, the task is to check if it is possible to split the given string into even length palindromic substrings. Examples: Input: str… Read More »

Given a string str of length N, the task is to obtain the lexicographically largest string by at most one swap. Note: The swapping characters… Read More »