## Check whether the string S1 can be made equal to S2 with the given operation

Given two string S1 and S2, the task is to check whether both the strings can be made equal by performing the given operation on… Read More »

- Number of substrings that start with "geeks" and end with "for"
- Count number of substrings of a string consisting of same characters
- 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
- 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
- Program to Encrypt a String using ! and @
- Concatenate the strings in an order which maximises the occurrence of subsequence "ab"
- Contiguous unique substrings with the given length L
- Minimum number of additons to make the string balanced

Given two string S1 and S2, the task is to check whether both the strings can be made equal by performing the given operation on… Read More »

Given a string S, the task is to find the number of ways to divide/partition the given string in sub-strings S1, S2, S3, …, Sk… Read More »

Given string str, the task is to convert it into a singly Linked List. Examples: Input: str = “ABCDABC” Output: A -> B -> C… Read More »

Given a string str consisting of lowercase and uppercase characters, the task is to find the minimum possible length the string can be reduced to… Read More »

Given a binary string S, the task is to find the number of ways to split it into parts such that every part is divisible… Read More »

Given a string S consisting of a large hexadecimal number, the task is to check its divisibility by a given decimal number M. If divisible… Read More »

Given a binary string S, the task is to find the maximum number of parts that you can split it into such that every part… Read More »

Given an input string which is comma-separated instead of space, the task is to parse this input string in C++. First, let us understand what… Read More »

Given a comma-separated string, the task is to parse this string and separate the words in C++. Examples: Input: “1, 2, 3, 4, 5” Output:… Read More »

Given a floating point number N, the task is to check whether it is palindrome or not. Input: N = 123.321 Output: Yes Input: N… Read More »

Given a string str consisting of lowercase English alphabets. The task is to change each character of the string with the next letter (in a… Read More »

Given an array s[] of N strings. The task is to find the number of pairs of indices (i, j) such that s[i] is an… Read More »

Given a string str of length N. The task is to find the number of integers obtained by replacing ‘?’ with any digit such that… Read More »

Given a string str of even size N consisting of lowercase English alphabets. The task is to find the number of rotated strings of str… Read More »

Given two strings str1 and str2, the task is to find the maximum number of times str1 occurs in str2 as a non-overlapping substring after… Read More »