## KARAN’S RELATIVES

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

Skip to content
## KARAN’S RELATIVES

## BECOME KING

## PROFIT PRIORITY

## FRACTION

## DIGIT GAME

## ACTIVITY SELECTION PROBLEM

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

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