Recursion, Backtracking and Dynamic Programming in Python
Recursion, Backtracking and Dynamic Programming in Python Course
Learn Competitive Programming, Recursion, Backtracking, Divide and Conquer Methods and Dynamic Programming in Python
This course is about the fundamental concepts of algorithmic problems focusing on recursion, backtracking, dynamic programming and divide and conquer approaches. As far as I am concerned, these techniques are very important nowadays, algorithms can be used (and have several applications) in several fields from software engineering to investment banking or R&D. In each section we will talk about the theoretical background for all of these algorithms then we are going to implement these problems together from scratch in Python.
Best Seller Course: Recursion, Backtracking and Dynamic Programming in Java
What you’ll learn
- Understanding recursion
- Understand backtracking.
- Understand dynamic programming.
- Understand divide and conquer methods.
- Implement 15+ algorithmic problems from scratch.
- Improve your problem-solving skills and become a stronger developer.
Recommended Course: 100 Days of Code: The Complete Python Pro Bootcamp for 2023 by Angela Yu
