BLOCK MOVE
CONCEPTS USED: Greedy algorithm. DIFFICULTY LEVEL: Easy. PROBLEM STATEMENT(SIMPLIFIED): You are given N blocks and the ith block is at position A[i]. Your task is to move every block to...
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...
Minus Minus is Plus
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...
Minimum Number of Steps to Make Two Strings Anagram
In the realm of string manipulation, anagrams hold a significant place due to their intriguing nature. An anagram is formed by rearranging the letters of one word or phrase to...