STACK SUM
CONCEPTS USED: Greedy algorithm. DIFFICULTY LEVEL: Medium. PROBLEM STATEMENT(SIMPLIFIED): You are given three stacks containing positive numbers. Let S1 be the sum of elements present in stack-1, S2 be the...
REMAINING GOLD COIN
CONCEPTS USED: Greedy algorithm. DIFFICULTY LEVEL: Medium. PROBLEM STATEMENT(SIMPLIFIED): You have a bag full of Gold Coins. Each coin has a positive integer inscribed on it, that denotes the value...
LARGEST NUMBER
CONCEPTS USED: Greedy algorithm DIFFICULTY LEVEL: Easy. PROBLEM STATEMENT(SIMPLIFIED): Arnab is given a number N, he is asked to remove one digit and print the largest possible number.Help Arnab find...
MAXIMIZE FLIP SIGN
CONCEPTS USED: Greedy algorithm. DIFFICULTY LEVEL: Medium. PROBLEM STATEMENT(SIMPLIFIED): Tina knows PrepBuddy likes to play games with array elements. So she gave PrepBuddy an array A containing N integers. She...
PROFIT PRIORITY
CONCEPTS USED: Greedy algorithm. DIFFICULTY LEVEL: Hard PROBLEM STATEMENT(SIMPLIFIED): One day Aman went to the office and his boss gave him some tasks to finish within the given deadline and...
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...
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...
Check Palindrome
CONCEPTS USED: Recursion DIFFICULTY LEVEL: Easy PROBLEM STATEMENT(SIMPLIFIED): Given a number N, check whether the number is palindrome or not using recursion. The palindrome number remains the same when its...