| 1 |
Activity Selection Problem |
| 2 |
Job SequencingProblem |
| 3 |
Huffman Coding |
| 4 |
Water Connection Problem |
| 5 |
Fractional Knapsack Problem |
| 6 |
Greedy Algorithm to find Minimum number of Coins |
| 7 |
Maximum trains for which stoppage can be provided |
| 8 |
Minimum Platforms Problem |
| 9 |
Buy Maximum Stocks if i stocks can be bought on i-th day |
| 10 |
Find the minimum and maximum amount to buy all N candies |
| 11 |
Minimize Cash Flow among a given set of friends who have borrowed money from each other |
| 12 |
Minimum Cost to cut a board into squares |
| 13 |
Check if it is possible to survive on Island |
| 14 |
Find maximum meetings in one room |
| 15 |
Maximum product subset of an array |
| 16 |
Maximize array sum after K negations |
| 17 |
Maximize the sum of arr[i]*i |
| 18 |
Maximum sum of absolute difference of an array |
| 19 |
Maximize sum of consecutive differences in a circular array |
| 20 |
Minimum sum of absolute difference of pairs of two arrays |
| 21 |
Program for Shortest Job First (or SJF) CPU Scheduling |
| 22 |
Program for Least Recently Used (LRU) Page Replacement algorithm |
| 23 |
Smallest subset with sum greater than all other elements |
| 24 |
Chocolate Distribution Problem |
| 25 |
DEFKIN -Defense of a Kingdom |
| 26 |
DIEHARD -DIE HARD |
| 27 |
GERGOVIA -Wine trading in Gergovia |
| 28 |
Picking Up Chicks |
| 29 |
CHOCOLA –Chocolate |
| 30 |
ARRANGE -Arranging Amplifiers |
| 31 |
K Centers Problem |
| 32 |
Minimum Cost of ropes |
| 33 |
Find smallest number with given number of digits and sum of digits |
| 34 |
Rearrange characters in a string such that no two adjacent are same |
| 35 |
Find maximum sum possible equal sum of three stacks |