## String Range Queries to find the number of subsets equal to a given String

Given a string S of length N, and M queries of the following type: Type 1: 1 L x, Indicates update Lth index of string… Read More »

- Count common characters in two strings
- Repeated Character Whose First Appearance is Leftmost
- Convert character array to string in C++
- Count substrings that contain all vowels | SET 2
- Find the longest string that can be made up of other strings from the array
- Minimum number of times A has to be repeated such that B is a substring of it
- Count of integers of length N and value less than K such that they contain digits only from the given set
- Check for balanced parentheses in an expression | O(1) space | O(N^2) time complexity
- Check whether two strings contain same characters in same order
- Rearrange characters in a string such that no two adjacent are same using hashing
- Generate all permutations of a string that follow given constraints
- Java program to check whether a string is a Palindrome
- Program to find the kth character after decrypting a string
- Check if two strings are same ignoring their cases
- Minimum number of adjacent swaps to convert a string into its given anagram
- Distinct palindromic sub-strings of the given string using Dynamic Programming
- Maximize the happiness of the groups on the Trip
- Program to generate all possible valid IP addresses from given string | Set 2
- Find the number of binary strings of length N with at least 3 consecutive 1s
- InfyTQ 2019 : Find the position from where the parenthesis is not balanced
- Implement a Dictionary using Trie
- Minimum rotations required to get the same String | Set-2
- Check if a string can be obtained by rotating another string d places
- Count pairs of non-overlapping palindromic sub-strings of the given string
- Append a digit in the end to make the number equal to the length of the remaining string
- Count of substrings which contains a given character K times
- C++ program to compare two Strings using Operator Overloading
- Reverse individual words with O(1) extra space
- Minimum number of sub-strings of a string such that all are power of 5
- Persistent Trie | Set 1 (Introduction)

Given a string S of length N, and M queries of the following type: Type 1: 1 L x, Indicates update Lth index of string… Read More »

Given a string str containing only lowercase characters. The task is to print the characters along with their frequencies in the order of their occurrence… Read More »

Given a String S of length N, two integers B and C, the task is to traverse characters starting from the beginning, swapping a character… Read More »

Given an array of strings, we need to sort the array in increasing order of string lengths, using Map Data Structure. Examples: Input: str[] =… Read More »

Given a string str consisting of lowercase alphabets and an integer K, you can perform the following operations on str Initialize an empty string X… Read More »

Given a large positive integer represented as a string str. The task is to round this number to the nearest multiple of 10. Examples: Input:… Read More »

Given a string str, the task is to find whether the string is a palindrome or not in Java without using library methods. Examples: Input:… Read More »

Given a chemical formula as a string, the task is to get the count of atoms in this chemical formula. Examples: Input: str = “Fe2H3OH”… Read More »

Write a function to check whether two given strings are an Anagram of each other or not. An anagram of a string is another string… Read More »

Given an input string and a substring. Find the frequency of occurrences of a substring in the given string using pthreads. Examples: Input: string =… Read More »

Pre-requisite: Operator Overloading in C++ Given two strings, how to check if the two strings are equal or not, using Operator Overloading. Examples: Input: ABCD,… Read More »

Given a string, the given string is an encrypted word, the task is to decrypt the given string to get the original word. Examples: Input:… Read More »

Given a string S of size N and Q queries. Every query consists of L and R ( 0 < = L < = R… Read More »

Given a string str, the task is to repeat every substring of the string X number of times where X is the number composed of… Read More »

Given a string str consisting of parenthesis from [ “(” , “)” , “{” , “}” , “[” , “]” ]. If the String is… Read More »