## Count the nodes of a tree whose weighted string does not contain any duplicate characters

Given a tree, and the weights (in the form of strings) of all the nodes, the task is to count the nodes whose weights does… Read More »

- Methods to concatenate string in C/C++ with Examples
- Java Program to print distinct permutations of a string
- Find the first maximum length even word from a string
- Repeated Character Whose First Appearance is Leftmost
- Count common characters in two strings
- Operations required to make the string empty
- Java ArrayList to print all possible words from phone digits
- Check whether two strings contain same characters in same order
- Program to find the kth character after decrypting a string
- Check for balanced parentheses in an expression | O(1) space | O(N^2) time complexity
- Count of words that are present in all the given sentences
- Find the longest string that can be made up of other strings from the array
- Generate all permutations of a string that follow given constraints
- Minimum length substring with exactly K distinct characters
- Maximize the happiness of the groups on the Trip
- Count pairs of non-overlapping palindromic sub-strings of the given string
- Count occurrences of a string that can be constructed from another given string
- Find the minimum number of preprocess moves required to make two strings equal
- Find the number of binary strings of length N with at least 3 consecutive 1s
- Convert character array to string in C++
- Check if two strings are same ignoring their cases
- Minimum steps to delete a string by deleting substring comprising of same characters
- Print the longest prefix of the given string which is also the suffix of the same string
- Maximize the value of A by replacing some of its digits with digits of B
- Minimum rotations required to get the same String | Set-2
- Count substrings that contain all vowels | SET 2
- Find k-th character of decrypted string | Set - 2
- 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
- Count of integers of length N and value less than K such that they contain digits only from the given set

Given a tree, and the weights (in the form of strings) of all the nodes, the task is to count the nodes whose weights does… Read More »

Given two strings A, B and some queries consisting of an integer i, the task is to check whether the sub-string of A starting from… Read More »

Given two binary strings s and t. The task is to rearrange the string s in such a way that the occurrence of string t… Read More »

Given a binary string str, the task is to find the maximum length of the sub-string of str that has odd parity. A binary string… Read More »

Given a string str, the task is to answer Q queries where every query consists of two integers L and R and we have to… Read More »

Given two integers N and M, the task is to print an N x M matrix such that each row and column contain all the… Read More »

Given a string str, the task is to check whether the string contains two non-overlapping sub-strings s1 = “geek” and s2 = “keeg” such that… Read More »

Given a string str, the task is to check whether the given string is made up of only two alternating characters. Examples: Input: str =… Read More »

Given an alphanumeric string str, the task is to sort the string in such a way that if a position is occupied by an alphabet… Read More »

Given a string, find the repeated character present first in the string. Examples: Input : geeksforgeeks Output : g (mind that it will be g,… Read More »

Given two strings s1 and s2 of same length, the task is to count the minimum number of pairs of characters (c1, c2) such that… Read More »

Given a string str, the task is to find the last non-repeating character in it. For example, if the input string is “GeeksForGeeks”, then the… Read More »

Given a string str which stores the time in the 24 hours format as HH:MM such that 0 ≤ HH ≤ 23 and 0 ≤… Read More »

Given a string str of lowercase alphabets, the task is to find all distinct palindromic sub-strings of the given string. Examples: Input: str = “abaaa”… Read More »

Given a binary string str of length N and two integers A and B such that 0 ≤ A < B < n. The task… Read More »