Concepts Used Strings, Hashing Difficulty Level Hard Problem Statement (Simplified): Find the minimum size of the substring of string S which contains all the character from a given string T....
Concepts Used Strings Difficulty Level Medium Problem Statement (Simplified): Given two string S and T containing only - and +. Two - together can form a single +. If it...
Concepts Used Strings, Hashing Difficulty Level Medium Problem Statement (Simplified): For given two string, Print minimum number of steps to make them anagram. See original problem statement here Test Case...
Concepts Used Strings, Sorting Difficulty Level Hard Problem Statement (Simplified): Given an array of numbers, arrange them in such a way that they form the largest number on joining. See...
Concepts Used Strings Difficulty Level Medium Problem Statement (Simplified): Find the longest palindromic substring in a given string and print the substring. See original problem statement here Test Cases: Input:...
Concepts Used String, Hashing Difficulty Level Easy Problem Statement (Simplified): Find the first non-repeating character in the string, print -1 if all characters are repeating. See original problem statement here...
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....
Concepts Used String Difficulty Level Easy Problem Statement (Simplified): Find the minimum length of substring, which on replacing with any other substring of the same length gives a string containing...
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...
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...
Concepts Used Strings, Hashing Difficulty Level Easy Problem Statement (Simplified): Check if string B can be achieved by A by rearranging letters of A. If yes print Yes else No;...
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...
Concepts Used Strings, Hash Table Difficulty Level Hard Problem Statement (Simplified): Find the total number of children standing on each square after 10100 rotations by every individual child. Each child...
Concepts Used Strings Difficulty Level Hard Problem Statement (Simplified): Print the decimal output of the fraction of two given numbers and enclose the repeating part in decimal places in brackets....
CONCEPTS USED: Recursion DIFFICULTY LEVEL: Easy PROBLEM STATEMENT(SIMPLIFIED): Given a string S, print the count of all contiguous substrings that start and end at the same character. For Example: Input...
CONCEPTS USED: Recursion DIFFICULTY LEVEL: Medium PROBLEM STATEMENT(SIMPLIFIED): Given two strings S1 and S2, print the count of all their Interleaving Strings. NOTE: Interleaving String is a string that has...
Concepts Used Strings, LPS array KPS Algorithm Difficulty Level Hard Problem Statement (Simplified): Find the minimum number of characters required to add to the given string to make it a...