Find the Window
Concepts Used Sorting Difficulty Level Medium Problem Statement (Simplified): Find the minimum length of the subarray when sorted completely sorts the given array. See original problem statement here Test Case...
Search Triplets
Concepts Used Sorting Difficulty Level Medium Problem Statement (Simplified): We have to find a triplet (n_{1}, n_{2}, n_{3}) in array such that sum of two number i.e. n_{1}+n_{2} equals to...
ACTIVITY SELECTION PROBLEM
CONCEPTS USED: Greedy algorithm. DIFFICULTY LEVEL: Medium. PROBLEM STATEMENT(SIMPLIFIED): PrepBuddy is given N activities with their start and finish times. The task is to select the maximum number of activities...
Salvation of Soul
Concepts Used Sorting Difficulty Level Medium Problem Statement (Simplified): For a given array, shift elements to the back of array until you get the minimum value of the whole array,...
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....
Aman and Shopping
Concepts Used Sorting Difficulty Level Easy Problem Statement (Simplified): For a given array A, find the total number of elements you can pick in given capacity X. You can't pick...
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...
Hometown Newspaper
Concepts Used Sorting Difficulty Level Medium Problem Statement (Simplified): Print the Strings according to their priority and category. If string belongs to hometown, it will have a priority higher than...
Minimum Dissatisfaction
Concepts Used Sorting, Mathematics Difficulty Level Hard Problem Statement (Simplified): For a given of N students, we are given two values P_{i} and Q_{i}. Find the minimum possible sum of...
Minimum Number of Steps to Make Two Strings Anagram
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...