## Longest palindromic String formed using concatenation of given strings in any order

Given an array of strings arr[] of the same length, the task is to find the longest palindromic string that can be made using the… Read More »

- Convert an unbalanced bracket sequence to a balanced sequence
- Maximum String Partition
- Number of substrings that start with "geeks" and end with "for"
- Count number of substrings of a string consisting of same characters
- Program to duplicate Vowels in String
- Count all substrings having character K
- Lexicographically smallest string of length N and sum K
- Compare two strings considering only alphanumeric characters
- Minimum given operations required to convert a given binary string to all 1's
- Check duplicates in a stream of strings
- Queries for rotation and Kth character of the given string in constant time
- 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
- Print characters having even frequencies in order of occurrence
- How to Append a Character to a String in C
- Minimum cost to convert str1 to str2 with the given operations
- Reverse the given string in the range [L, R]
- Modulo of a large Binary String
- Check if expression contains redundant bracket or not | Set 2
- Reverse every word of the string except the first and the last character
- 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
- Find the character made by adding all the characters of the given string
- Find the occurrence of the given binary pattern in the binary representation of the array elements
- Print characters in decreasing order of frequency
- Longest substring such that no three consecutive characters are same
- Sort groups of numbers and characters separately in a String
- Expand the string according to the given conditions
- Find the number of strings formed using distinct characters of a given string
- Lexicographical ordering using Heap Sort

Given an array of strings arr[] of the same length, the task is to find the longest palindromic string that can be made using the… Read More »

Given a string consisting of only lowercase English alphabets. The task is to count the total number of alphabetically smaller characters on the right side… Read More »

Given a string consisting of characters a and b, check if the string starts and ends with the same character or not. If it does,… Read More »

Prerequisite: Deterministic Finite Automata Given a string str consists of characters ‘a’ & ‘b’. The task is to check whether string str starts and ends… Read More »

Given a number N, the task is to convert every digit of the number into words. Examples: Input: N = 1234 Output: One Two Three… Read More »

Given a list of strings, the task is to find the sum of all LCP (Longest Common Prefix) of maximum length by selecting any two… Read More »

Given an array of strings arr[], for every string in the array, print all possible combinations of strings that can be concatenated to make that… Read More »

Given a binary string str of length N and an integer K, the task is to find the minimum number of steps required to move… Read More »

DFA or Deterministic Finite Automata is a finite state machine which accepts a string(under some specific condition) if it reaches a final state, otherwise rejects… Read More »

Given a Linked List which represents a sentence S such that each node represents a letter, the task is to reverse the sentence without reversing… Read More »

Given two string X and Y of the same length which consists of lowercase letters and also an integer K. The task is to find… Read More »

Given a string str, the task is to find the length of the longest palindromic subsequence of even length with no two adjacent characters same… Read More »

Given two strings A and B consisting of only lowercase letters, the task is to find the minimum number of subsequences required from A to… Read More »

Given a string str, the task is to find the maximum length K such that there exist two sub-sequences A and B each of length… Read More »

Given a palindromic string str and an integer N. The task is to find if it is possible to remove exactly N characters from the… Read More »