## Check if permutaion of one string can break permutation of another

Given two strings str1 and str2, the task is to check if any permutation of the given strings str1 and str2 is possible such that… 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
- Count the number of ways to construct the target string
- Check if given words are present in a string
- Kth most frequent Character in a given String
- Count of substrings of length K with exactly K distinct characters
- Sort a string according to the frequency of 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
- Count minimum swap to make string palindrome
- Justify the given Text based on the given width of each line
- Check if the given string is shuffled substring of another string
- Frequency of maximum occurring subsequence in given string
- Convert Character Array To String In Java
- Digital Root of a given large integer using Recursion
- Count ways to partition a string such that both parts have equal distinct characters
- Length of the smallest substring which contains all vowels
- Shortest Palindromic Substring
- Java program to print Even length words in a String
- Calculate the frequency of each word in the given string
- Remove odd frequency characters from the string
- Move all occurence of letter 'x' from the string s to the end using Recursion
- Sort an array of Strings according frequency
- Sort the strings based on the numbers of matchsticks required to represent them
- Longest Palindrome in a String formed by concatenating its prefix and suffix
- Processing strings using std::istringstream

Given two strings str1 and str2, the task is to check if any permutation of the given strings str1 and str2 is possible such that… Read More »

Given a string S and an integer K, the task is to find the total number of strings that can be formed by inserting exactly… Read More »

Given two string S and T, the task is to find the minimum length prefix from S which consists of all characters of string T.… Read More »

Given two numeric Hexadecimal numbers str1 and str2, the task is to add the two hexadecimal numbers. Hexadecimal Number system, often shortened to “hex”, is… Read More »

Given a binary strings S of length N, the task is to obtain S from a string, say T, of length N consisting only of… Read More »

Given a string str, the task is to find the minimum length of substrings such that all the sub strings of that length from str… Read More »

Given an integer N, the task is to find the number of possible binary strings of length N with an equal frequency of 0‘s and… Read More »

Given string str of perfect square length. The task is to check whether the given string is a right to left diagonal or not. If… Read More »

Given a string str and an array of special characters, specialArray[], the task is to find the sum of the ratio of the count of… Read More »

Given a string S, the task is to calculate the minimum cost to sort the string in increasing order of their frequencies by swapping a… Read More »

Given two strings str1 and str2, the task is to check if it is possible to form a Palindromic String by concatenation of two substrings… Read More »

Given a list of N distinct integers and a list of N-1 inequality signs, the task is to insert the integers between the inequality signs,… Read More »

Given a string str, the task is to check whether the given string is linear or not. If it is linear then print “Yes” else… Read More »

Give binary string str and an integer N, the task is to check if the substrings of the string contain all binary representations of non-negative… Read More »

Given a string str which has various HTML Entities in it, the task is to replace these entities with their corresponding special character. HTML entity… Read More »