Get free ebooK with 50 must do coding Question for Product Based Companies solved
Fill the details & get ebook over email
Thank You!
We have sent the Ebook on 50 Must Do Coding Questions for Product Based Companies Solved over your email. All the best!

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

## Dedicate Length

CONCEPTS USED: Greedy algorithm. DIFFICULTY LEVEL: Medium. PROBLEM STATEMENT(SIMPLIFIED): Nikhil wants to bring sofa(s) to his room. But he wants to dedicate the entire length of the room to 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...

## MAXIMUM VALUE

CONCEPTS USED: Greedy algorithm(fractional knapsack) DIFFICULTY LEVEL: Medium PROBLEM STATEMENT(SIMPLIFIED): One day some guests came to Aman's home. Aman's mama told him to bring N items from the market and...

## FIND SHELTER

CONCEPTS USED: Greedy algorithm. DIFFICULTY LEVEL: Easy. PROBLEM STATEMENT(SIMPLIFIED): Nishant is lost along with his N−1 wandering friends. Now they have to find some shelter. Nishant and his N−1 friends...

## KARAN’S RELATIVES

CONCEPTS USED: Greedy algorithm, Kruskal's algorithm. DIFFICULTY LEVEL: Hard PROBLEM STATEMENT(SIMPLIFIED): Karan's came home after a long time and he wants to visit all the relatives. The total number of...

## KABADDI MODIFIED

CONCEPTS USED: Greedy algorithm DIFFICULTY LEVEL: Medium. PROBLEM STATEMENT(SIMPLIFIED): Arnab has made a team and he wants to fight with another team with some modified form of Kabaddi. In this...

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

## FRACTION

CONCEPTS USED: Greedy algorithm. DIFFICULTY LEVEL: Medium. PROBLEM STATEMENT(SIMPLIFIED): Now Arnab is given a fraction N/D. He is asked to divide the fraction in sum of unique unit fractions where...

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