Learn Dynamic Programing

This course consists of all imp DP concepts. If you want to feel & visualize DP, then this course is for you.

This course starts with introduction of recursion and then gradually moving to dynamic problems with the help of just plain recursions i.e. top down approach for DP problems.
After that it covers inclusion , exclusion principle in great detail with many examples! It also include knapsack problem explanation in a very elegant way and visualizing each and every recursion with the help of proper diagrams and videos. It also discusses unbounded knapsack problems and many other palindromic string DP algorithm. It also discusses LCS problems in great detail. Memoization for top down approach as well as bottom up approach is discussed to enable the students to take the call on their own for any given problem. Each session does not only contain explanation of the problem and solution which is generally observed in other courses, but mentor extends himself to go in great depth of recursion to make sure that students can feel and visualize the recursive solutions in a very well manner.

Mentor:

Abhilash Rudra is Ex ACM-ICPC regionalist with rank within top 40. He was also featured within Top 30 Algorithmic coders in the world on HackerEarth Monthly Algorithmic contests.
His main area of interest is Algorithms, Mathematics. He has 4+ years of industry exp. in the field of software development, Algorithmic Research, core mathematical research.