Recursion, Backtracking 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. Thanks for joining the course, let's get started!