2K followers • Advanced
Jan 22, 2021 • 1h 21m • 201 views
In this class we are going to see a special optimization in Dynamic Programming, called Divide and Conquer DP. This method utilizes the divide and conquer paradigm to find the optimal values of dp faster. We are also going to solve problems based on this concept.