Greedy method is a simple technique that makes decisions based on current information without worrying about future outcomes.
It may not always provide the optimal solution.
For a problem to be solved by greedy approach, it should satisfy the Greedy Choice Property and Optimal Sub Problem Property.
Examples of problems that can be solved using greedy approach include finding shortest path, minimum spanning tree, job sequencing, and fractional knapsack.