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

Skip to content
## STACK SUM

## REMAINING GOLD COIN

## LARGEST NUMBER

## MAXIMIZE FLIP SIGN

## PROFIT PRIORITY

## ACTIVITY SELECTION PROBLEM

## Minimum Window Substring

## Minus Minus is Plus

## Minimum Number of Steps to Make Two Strings Anagram

## Check Palindrome

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

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

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

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

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

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

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