Student Marks
Concepts Used Queue, Basic Implementation Difficulty Level Easy Problem Statement : You are given a binary tree, you need to print the average of each level of the tree. See...
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...
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...
BECOME KING
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....
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...
DIGIT GAME
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...
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...
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...
Form the Largest Number
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...
Longest Palindromic Substring
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...
First character
Concepts Used String, Hashing Difficulty Level Easy Problem Statement (Simplified): Find the first non-repeating character in the string, print -1 if all characters are repeating. See original problem statement here...
Distint Concat
Concepts Used String Difficulty Level Hard Problem Statement (Simplified): Find the total number of substrings which are the concatenation of the same strings, e.g.PP if formed by concatenating P twice....
Code Characters
Concepts Used String Difficulty Level Easy Problem Statement (Simplified): Find the minimum length of substring, which on replacing with any other substring of the same length gives a string containing...
Branches of Bytecode
Concepts Used String Difficulty Level Hard Problem Statement (Simplified): For given n strings and a separator s, print n/2 number of strings of equal length, by concatenating two substrings with...
Find the Closest Palindrome
Concepts Used Strings Difficulty Level Hard Problem Statement (Simplified): For given numbers we have to print the nearest anagram to it if two numbers are equidistant and anagram to the...
Anagram or Not
Concepts Used Strings, Hashing Difficulty Level Easy Problem Statement (Simplified): Check if string B can be achieved by A by rearranging letters of A. If yes print Yes else No;...
Aman and Math
Concepts Used Strings Difficulty Level Hard Problem Statement (Simplified): Find the maximum answer by evaluating the given string and putting a bracket anywhere in the string. See original problem statement...
Square Moves
Concepts Used Strings, Hash Table Difficulty Level Hard Problem Statement (Simplified): Find the total number of children standing on each square after 10100 rotations by every individual child. Each child...