Greedy
Local optimal choices, interval scheduling & activity selection
6 Problems
All
Easy
Medium
Hard
⌘K
#
Problem
Difficulty
Actions
01.
N meetings in one room
Easy
02.
Minimum number of platforms required for a railway
Medium
03.
Job sequencing Problem
Medium
04.
Fractional Knapsack Problem
Medium
05.
Greedy algorithm to find minimum number of coins
Easy
06.
Activity Selection
Easy