Back to Topics
Greedy
Your Progress
Progress
0%
Total Problems
35
Completed
0
Status | Problem | Bookmark | Notes | Actions |
---|---|---|---|---|
Activity Selection Problem | ||||
Job SequencingProblem | ||||
Huffman Coding | ||||
Water Connection Problem | ||||
Fractional Knapsack Problem | ||||
Greedy Algorithm to find Minimum number of Coins | ||||
Maximum trains for which stoppage can be provided | ||||
Minimum Platforms Problem | ||||
Buy Maximum Stocks if i stocks can be bought on i-th day | ||||
Find the minimum and maximum amount to buy all N candies | ||||
Minimize Cash Flow among a given set of friends who have borrowed money from each other | ||||
Minimum Cost to cut a board into squares | ||||
Check if it is possible to survive on Island | ||||
Find maximum meetings in one room | ||||
Maximum product subset of an array | ||||
Maximize array sum after K negations | ||||
Maximize the sum of arr[i]*i | ||||
Maximum sum of absolute difference of an array | ||||
Maximize sum of consecutive differences in a circular array | ||||
Minimum sum of absolute difference of pairs of two arrays | ||||
Program for Shortest Job First (or SJF) CPU Scheduling | ||||
Program for Least Recently Used (LRU) Page Replacement algorithm | ||||
Smallest subset with sum greater than all other elements | ||||
Chocolate Distribution Problem | ||||
DEFKIN -Defense of a Kingdom | ||||
DIEHARD -DIE HARD | ||||
GERGOVIA -Wine trading in Gergovia | ||||
Picking Up Chicks | ||||
CHOCOLA –Chocolate | ||||
ARRANGE -Arranging Amplifiers | ||||
K Centers Problem | ||||
Minimum Cost of ropes | ||||
Find smallest number with given number of digits and sum of digits | ||||
Rearrange characters in a string such that no two adjacent are same | ||||
Find maximum sum possible equal sum of three stacks |