It is a merely a technique in which we believe locally optimal solution would also work for global solution. Always keep in mind that there is no guarantee that locally optimal solution would be globally best solution
1. Greedy Algorithm to find Minimum number of Coins (EASY) 2. N meetings in one room (EASY) 3. Maximize sum(arr[i]*i) of an Array 4. Minimum Platforms Problem (MEDIUM) 5. Minimize Cash Flow among a given set of friends who have borrowed money from each other (HARD) 6. N meetings in one room (EASY) 7. Swap and Maximise (EASY) 8. Page Faults in LRU(MEDIUM) 9. Highest Product (EASY) 10. Assign Mice to Holes (MEDIUM) 11. Gas Station (HARD) 12. Find Maximum Equal sum of Three Stacks