## Minimum Window Substring

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....

Skip to content
## Minimum Window Substring

## Minus Minus is Plus

## Minimum Number of Steps to Make Two Strings Anagram

## Form the Largest Number

## Longest Palindromic Substring

## First character

## Distint Concat

## Code Characters

## Branches of Bytecode

## Find the Closest Palindrome

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...