In this video Greedy and DP are compared and discussed. Both approaches are used to solve Optimization Problems. There are few similarities and few differences between these approaches, which is discussed in this video in detail. In previous video, the idea of DP, Divide and Conquer and Memoization has been discussed. First part is available at : • Divide & Conquer | Dynamic Programming | G...