Ultimate Specialisation on Recursion, Backtracking and Dynamic Programming for Competitive Coding & Interviews.
What you'll learn
- Identify what type of problems can be solved using DP
- Come with recurrence for most DP Problems
- Master the advance DP techniques
- Face interviews and online challenges more confidently
Requirements
- Basic understanding of algorithms
- Ability to write/understand code in programming language
- Familiarity with Arrays, 2D Arrays, Data Structures
Description
Are you feeling brushed-up with data structures and algorithms but often feel stuck when it comes to DP! But no more, we are super happy to present the Dynamic Programming Specialisation Course for everyone, to help you master the important Dynamic Programming Concepts and level up for Competitive Coding & Interviews.The Dynamic Programming Master Course is taught by Apaar Kamal, software engineer at Google & Master on Codeforces along with Prateek Narang, an ex-Google engineer and founder of Coding Minutes. This highly detailed & rigorous curriculum has been designed to ensure your success in online competitions where Dynamic Programming problems are very common these days.
Many top companies like Google, Facebook, Amazon, Directi, CodeNation, Goldman Sachs etc encourage Competitive Programming and conduct coding competitions to hire smart people who can solve problems.
Dynamic Programming is a popular algorithmic technique in computer programming that helps to efficiently solve a class of problems that have overlapping subproblems and optimal substructure property.
If any problem can be divided into subproblems, which in turn are divided into smaller subproblems, and if there are overlapping among these subproblems, then the solutions to these subproblems can be saved for future reference. In this way, algorithm can be improved, and lot of problems can be optimised using Dynamic Programming.
The 40+ hours course covers the breadth & depth of dynamic programming starting from a recap of recursion, backtracking, and diving deep into Dynamic Programming techniques like -
- 1D, 2D, Multi-dimensional DP
- DP and Partition Problems
- DP for Combinatorics & Subsequences
- DP on Strings
- Digit DP
- DP on Trees & Graphs
- SOS DP and
- DP with Bitmasks
- DP and Matrix Exponentiation
- DP in Game Theory
[Extra] You will also get Full Solved Atcoder Educational DP Contest as part of the course.
Course Highlights
* Detailed video explanations
* Deep dive into advanced DP Concepts
* Carefully curated practice problem sheets
* Full Life Time Access
* All variants of DP Covered
So, what are you waiting for - join the course now and level-up your DP Skills! *
Who this course is for:
- Programmers looking forward to level up in algorithms
- Students preparing for online competitions like ACM-ICPC, Google CodeJam etc
- Tech aspirants preparing for Interviews and online coding rounds
- Programming enthusiasts who want to deep dive into Competitive Programming
