Dynamic Programming Series | Day - 14 | DP with combinatorics | Color 3Xn board | Leetcode problem

This is a dynamic programming series which will include concepts that are required to build a strong foundation in dynamic programming. This video is in the continuation of Dynamic programming series. This video contains the practical utility of the concepts like dynamic programming with combinatorics and brute force on dp. The concepts are explained in the best possible way with the help of animation and simplified to the best extent possible. Hope you will like the efforts..!! The link to the problem is: https://leetcode.com/problems/number-of-ways-to-paint-n-3-grid/ The link to the playlist is: https://www.youtube.com/playlist?list=PLtBICreuIvuuVifFHcHvIUR6elWTy1K5v Links to problem of same pattern : https://www.interviewbit.com/problems/sub-matrices-with-sum-zero/ https://www.geeksforgeeks.org/binomial-coefficient-dp-9/ https://codeforces.com/contest/1288/problem/C The link to the explinatory ppt is : https://slides.com/chirayujain-2/3xn-board/fullscreen For any doubts and queries you can contact me through the following links : Mail info : [email protected] [email protected] Linkedin profile : https://www.linkedin.com/in/chirayu-jain-3b7795111/ Facebook profile : https://www.facebook.com/chirayu.jain.127 Instagram profile : https://www.instagram.com/chirayu.jain98/?hl=en