Minimum Window Substring
Find the minimum size of the substring of string S which contains all the character from a given string T. Print the substring with minimum length. See original problem statement...
Distint Concat
Concepts Used String Difficulty Level Hard Problem Statement (Simplified): Find the total number of substrings which are the concatenation of the same strings, e.g.PP if formed by concatenating P twice....
Branches of Bytecode
Concepts Used String Difficulty Level Hard Problem Statement (Simplified): For given n strings and a separator s, print n/2 number of strings of equal length, by concatenating two substrings with...
Find the Closest Palindrome
Concepts Used Strings Difficulty Level Hard Problem Statement (Simplified): For given numbers we have to print the nearest anagram to it if two numbers are equidistant and anagram to the...
Aman and Math
Concepts Used Strings Difficulty Level Hard Problem Statement (Simplified): Find the maximum answer by evaluating the given string and putting a bracket anywhere in the string. See original problem statement...