## Find index of closing bracket for a given opening bracket in an expression

Given a string with brackets. If the start index of the open bracket is given, find the index of the closing bracket. Examples: Input :… 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 with brackets. If the start index of the open bracket is given, find the index of the closing bracket. Examples: Input :… Read More »

Given a string of size n, write functions to perform following operations on string. Left (Or anticlockwise) rotate the given string by d elements (where… Read More »

Given a string s and two other strings begin and end, find the number of different substrings in the string which begin and end with… Read More »

Given a string containing characters ‘a’ and ‘b’ only. Convert the given string into a string in which there is no ‘ab’ substring. To make… Read More »

Given a input string and a substring. Find the frequency of occurrences of substring in given string. Examples: Input : man (pattern) dhimanman (string) Output… Read More »

Many of us have encountered error ‘cannot covert std::string to char[] or char* data type’. Examples: Input : string s = “geeksforgeeks” ; Output :… Read More »

Given a string and a number N, we need to mirror the characters from N-th position up to the length of the string in the… Read More »

Given a string, print it inside a matrix in such a way that a ‘plus’ is formed. Examples: Input: TOP Output: X T X T… Read More »

Given a string s, break s such that every substring of the partition can be found in the dictionary. Return the minimum break needed. Examples:… Read More »

Given an integer n. Find a string of characters ‘a’ and ‘b’ such that the string doesn’t contain any palindrome of length 3. Examples: Input… Read More »

Given a dictionary and a character array, print all valid words that are possible using characters from the array. Note: Repetitions of characters is not… Read More »

Given a String S, consider a new string formed by repeating the S exactly K times. We need find the number of subsequences as “ab”… Read More »

Convert string S into a palindrome string. You can only replace a character with any other character. When you replace character ‘a’ with any other… Read More »

Given a string check if it is Pangram or not. A pangram is a sentence containing every letter in the English Alphabet. Lowercase and Uppercase… Read More »

Design a program to take a word as an input, and then encode it into a Pig Latin. A Pig Latin is an encrypted word… Read More »