There are three commonly used approaches to develop algorithms − Greedy Approach − finding solution by choosing next best option Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly