## Minimum removal to make palindrome permutation

Given a string S, we have to find minimum characters that we can remove to make any permutation of the string S a palindrome. In… Read More »

- Methods to concatenate string in C/C++ with Examples
- Find the first maximum length even word from a string
- Repeated Character Whose First Appearance is Leftmost
- Count common characters in two strings
- Find the longest string that can be made up of other strings from the array
- Count substrings that contain all vowels | SET 2
- Convert character array to string in C++
- Check whether two strings contain same characters in same order
- Check for balanced parentheses in an expression | O(1) space | O(N^2) time complexity
- Program to find the kth character after decrypting a string
- Count of integers of length N and value less than K such that they contain digits only from the given set
- Minimum length substring with exactly K distinct characters
- Generate all permutations of a string that follow given constraints
- Maximize the happiness of the groups on the Trip
- Minimum number of times A has to be repeated such that B is a substring of it
- Rearrange characters in a string such that no two adjacent are same using hashing
- Distinct palindromic sub-strings of the given string using Dynamic Programming
- Check if two strings are same ignoring their cases
- Find the number of binary strings of length N with at least 3 consecutive 1s
- Print the longest prefix of the given string which is also the suffix of the same string
- Count pairs of non-overlapping palindromic sub-strings of the given string
- Minimum rotations required to get the same String | Set-2
- Append a digit in the end to make the number equal to the length of the remaining string
- Minimum steps to delete a string by deleting substring comprising of same characters
- Program to generate all possible valid IP addresses from given string | Set 2
- Find k-th character of decrypted string | Set - 2
- Minimum number of adjacent swaps to convert a string into its given anagram
- Check if a string can be obtained by rotating another string d places
- Optimally accommodate 0s and 1s from a Binary String into K buckets
- Count of substrings which contains a given character K times

Given a string S, we have to find minimum characters that we can remove to make any permutation of the string S a palindrome. In… Read More »

Partition given string in such manner that i’th substring is sum of (i-1)’th and (i-2)’nd substring. Examples: Input : “11235813” Output : [“1”, “1”, “2”,… Read More »

Given a sorted array of strings which is interspersed with empty strings, write a method to find the location of a given string. Examples: Input… Read More »

Given a large number as string s and an integer k which denotes the number of breakpoints we must put in the number k <=… Read More »

Given a sentence str. The problem is to remove all the palindromic words from the given sentence. Examples: Input : str = “Text contains malayalam… Read More »

Infix : An expression is called the Infix expression if the operator appears in between the operands in the expression. Simply of the form (operand1… Read More »

Prefix : An expression is called the prefix expression if the operator appears in the expression before the operands. Simply of the form (operator operand1… Read More »

String is an important topic from GATE exam point of view. We will discuss key points on strings as well different types of questions based… Read More »

Postfix: An expression is called the postfix expression if the operator appears in the expression after the operands. Simply of the form (operand1 operand2 operator).… Read More »

Given a string, convert the string to palindrome without any modifications like adding a character, removing a character, replacing a character etc. Examples: Input :… Read More »

Given a string s, find length of the longest prefix which is also suffix. The prefix and suffix should not overlap. Examples: Input : aabcdaabc… Read More »

Infix expression: The expression of the form a op b. When an operator is in-between every pair of operands. Postfix expression: The expression of the… Read More »

Write a program to print all distinct permutations of a given string in sorted order. Note that the input string may contain duplicate characters. In… Read More »

Time complexity of printing all permutations of a string. 1. void perm(String str){ 2. perm(str, “”); 3. } 4. 5. void perm(String str, String prefix){… Read More »

Given a string s, count special substrings in it. A Substring of S is said to be special if either of the following properties is… Read More »