## AMAN RELATIVES

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

Skip to content
## AMAN RELATIVES

## STACK SUM

## Dedicate Length

## REMAINING GOLD COIN

## LARGEST NUMBER

## MAXIMIZE FLIP SIGN

## MAXIMUM VALUE

## FIND SHELTER

## KARAN’S RELATIVES

## BECOME KING

## KABADDI MODIFIED

## PROFIT PRIORITY

## FRACTION

## DIGIT GAME

## BLOCK MOVE

## Find the Window

## Search Triplets

## ACTIVITY SELECTION PROBLEM

## Salvation of Soul

## Minimum Window Substring

## Aman and Shopping

## Minus Minus is Plus

## Hometown Newspaper

## Minimum Dissatisfaction

## Minimum Number of Steps to Make Two Strings Anagram

## Form the Largest Number

## Longest Palindromic Substring

## Maximum Sum Rupees

## Maximum Divisors in a Range

## Find the Inversion Count

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!

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

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): Nikhil wants to bring sofa(s) to his room. But he wants to dedicate the entire length of the room to 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(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...

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

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

CONCEPTS USED: Greedy algorithm, Priority Queues DIFFICULTY LEVEL: Medium. PROBLEM STATEMENT(SIMPLIFIED): Himanshu now wants to become the king. He has N persons to defeat before he can become the King....

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

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): Now Arnab is given a fraction N/D. He is asked to divide the fraction in sum of unique unit fractions where...

CONCEPTS USED: Greedy algorithm. DIFFICULTY LEVEL: PROBLEM STATEMENT(SIMPLIFIED): Arnab is playing a game. He is given a number N in string format and now he is asked to remove M...

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

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

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

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

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

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

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

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

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

Concepts Used Strings, Sorting Difficulty Level Hard Problem Statement (Simplified): Given an array of numbers, arrange them in such a way that they form the largest number on joining. See...

A palindrome is a sequence of characters that reads the same forwards and backward. Finding the longest palindromic substring is a common problem in computer science and has applications in...

Concepts Used Sorting Difficulty Level Hard Problem Statement (Simplified): We have to find the maximum sum of elements from two arrays, such that you can select elements to add only...

Concepts Used Sorting Difficulty Level Hard, Mathematics Problem Statement (Simplified): For a given range p and q, find the highest common factor of two given numbers, i.e. a and b....

Concepts Used Sorting Difficulty Level Hard Problem Statement (Simplified): Find number of pairs such that a[i] > a[j] and i < j. Test Case Input: 1 5 10 50 20...