Recursion, Backtracking and Dynamic Programming in Python (Udemy.com)
Learn Competitive Programming, Recursion, Backtracking, Divide and Conquer Methods and Dynamic Programming in Python
Created by: Holczer Balazs
Last updated September 2025
What you will 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
How it compares
Against the other 388 rated Udemy courses in Python on CourseDuck:
- Rating4.6 out of 5higher than 70% of them
- Reviews936#193 of 389 by number of reviews
- Length15.8 hourslonger than 67% of them
- Last updatedSeptember 2025more recently than 69% of them
Course Description
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.
Section 1 - RECURSION
what are recursion and recursive methods
stack memory and heap memory overview
what is stack overflow?
Fibonacci numbers
factorial function
tower of Hanoi problem
Section 2 - SEARCH ALGORITHMS
linear search approach
binary search algorithm
Section 3 - SELECTION ALGORITHMS
what are selection algorithms?
Hoare's algorithm
how to find the k-th order statistics in O(N) linear running time?
quickselect algorithm
median of medians algorithm
the secretary problem
Section 4 - BIT MANIPULATION PROBLEMS
binary numbers
logical operators and shift operators
checking even and odd numbers
bit length problem
Russian peasant multiplication
Section 5 - BACKTRACKING
what is backtracking?
n-queens problem
Hamiltonian cycle problem
coloring problem
knight's tour problem
maze problem
Sudoku problem
Section 6 - DYNAMIC PROGRAMMING
what is dynamic programming?
knapsack problem
rod cutting problem
subset sum problem
Kadane's algorithm
longest common subsequence (LCS) problem
Section 7 - OPTIMAL PACKING
what is optimal packing?
bin packing problem
Section 8 - DIVIDE AND CONQUER APPROACHES
what is the divide and conquer approach?
dynamic programming and divide and conquer method
how to achieve sorting in O(NlogN) with merge sort?
the closest pair of points problem
Section 9 - Substring Search Algorithms
substring search algorithms
brute-force substring search
Z substring search algorithm
Rabin-Karp algorithm and hashing
Knuth-Morris-Pratt (KMP) substring search algorithm
Section 10 - COMMON INTERVIEW QUESTIONS
top interview questions (Google, Facebook and Amazon)
anagram problem
palindrome problem
integer reversion problem
dutch national flag problem
trapping rain water problem
Section 11 - Algorithms Analysis
how to measure the running time of algorithms
running time analysis with big O (ordo), big Ω (omega) and big θ (theta) notations
complexity classes
polynomial (P) and non-deterministic polynomial (NP) algorithms
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!
Instructor Details
- 4.6 Rating
936 Reviews
Holczer Balazs
My name is Balazs Holczer. I am from Budapest, Hungary. I am qualified as a physicist. At the moment I am working as a simulation engineer at a multinational company. I have been interested in algorithms and data structures and its implementations especially in Java since university. Later on I got acquainted with machine learning techniques, artificial intelligence, numerical methods and recipes such as solving differential equations, linear algebra, interpolation and extrapolation. These things may prove to be very very important in several fields: software engineering, research and development or investment banking. I have a special addiction to quantitative models such as the Black-Scholes model, or the Merton-model.
Take a look at my website if you are interested in these topics!
More courses by Holczer Balazs
Python Data Structures And Algorithms: Practical Course (2026)
4.7 (4,432 Reviews)
Provider: Udemy
Time: 23.6h
$16.99
Concurrency, Multithreading and Parallel Computing in Java (2026)
4.5 (4,034 Reviews)
Provider: Udemy
Time: 14.4h
$10.99
Software Architectures (SOLID) & Design Patterns in Java (2026)
4.6 (3,772 Reviews)
Provider: Udemy
Time: 9.4h
$11.99
Introduction to Collections, Generics & Reflection in Java (2026)
4.5 (3,649 Reviews)
Provider: Udemy
Time: 11h
$10.99
Algorithms Data Structures in Java #1 (+INTERVIEW QUESTIONS) (2026)
4.7 (3,235 Reviews)
Provider: Udemy
Time: 22.1h
$13.99
Quantitative Finance & Algorithmic Trading in Python (2026)
4.6 (2,714 Reviews)
Provider: Udemy
Time: 18.3h
$13.99
More Python courses
Python 3: Deep Dive (Part 1 - Functional) (2024)
4.9 (13,534 Reviews)
Provider: Udemy
Time: 45.8h
$22.99
Python 3: Deep Dive (Part 3 - Dictionaries, Sets, JSON) (2023)
4.9 (1,996 Reviews)
Provider: Udemy
Time: 21.9h
$17.99
Programming for Everybody (Getting Started with Python)
4.9 (717 Reviews)
Provider: Coursera
Time: 12h
Free
An Introduction to Interactive Programming in Python (2013)
4.9 (554 Reviews)
Provider: Coursera
Time: 6h 40m
Free
Python: Python Programming Language | Tutorial | Beginner (2023)
4.9 (239 Reviews)
Provider: Udemy
Time: 5.1h
$19.99
An Introduction to Interactive Programming in Python (Part 2)
4.9 (225 Reviews)
Provider: Coursera
Time: 25h
Free
Reviews
By Jay Pedersen on 11/11/2022
I have taken many data structure courses on udemy and elsewhere. I learned a LOT from this course. This course was extremely ambitious in its content -- a very large number of non-trivial algorithms were covered. Many different algorithm strategies were covered (brute force, recursion, backtracking, divide and conquer, dynamic programming, and even a bit on heuristics). The course even gets into bit manipulations that can be done that Python supports. The treatment was not lacking as you might expect with so much being attempted to be covered. Instead you were treated to in depth explanations of the algorithms and step by step visualizations of how the algorithms operate. Importantly, the provided python source code WORKS. I did not run into any issues with the provided code. That is not always the case in these courses. Again, my congratulations on a job well-done. This is the best algorithm course I have taken. Thank you Holczer Balazs! Caveat: I believe there is some prior knowledge assumed, such as you are familiar with some basic algorithms like bubble sort and basic data structures like linked lists and perhaps binary search trees. I think the only sorting algorithm covered was merge sort. I am looking forward to the the second course on algorithms in python being offered by Holzcer. Thanks again!
By Vahan Khachatryan on 3/21/2022
Topics are covered deep enough. I'm getting a lot of new information. Holczer Balazs' approach is very effective. His explanations are clear. In addition, he adds comments in the code and verbally re-iterates the meaning of a code block. While this sounds like a small detail but it helps me to remember algorithm as the author slowly reads the comment while typing it. I noticed minor mistakes in the beginning of the course which doesn't affect the quality of material. I wasn't happy initially, but then I saw the rest of the course is all fine.
By Jill Wellman on 3/5/2021
I know much of this material, but want to complete my knowledge. The speaker is clear and concise and easy to follow while integrating with prior knowledge. ON MOBILE. Too little space for code /shell screen. Lecture list could be smaller or offscreeen.
By Ben Bartling on 11/1/2020
There is a lot of knowledge here great course. The instructor accent is a little hard but well worth purchasing the course. I don't have a degree in computer science where this stuff is studied in university so its great there is a course that covers theory!
By Naveen on 8/27/2020
Good content! Especially the backtracking and dynamic programming lectures were spot on! anyone who understands this course thoroughly can write recursive, backtracking and dynamic programming algorithms on their own for any given problems.
By Dennis Jordan on 6/7/2020
It's good. Sometimes, I find the instructor moves quickly and could spend more time explaining fundamental concepts that are complex. For example, it took me a long time to wrap my head around the concept of recursion. It's complex. The course provides lots of chances to use recursion, which is a great way to learn, but I wanted to understand the concept from the start. I found it complex to mentally keep track of different layers and their variables, and watched a number of YouTube videos to accelerate the process. Ultimately, I think the film Inception is a good analogy for climbing down into and out of recursive layers, and after reflecting away from the computer for an afternoon it started to sink in. The thing is, I think I'm actually pleased that the professor didn't spoon feed this. He did spend a few lectures explaining recursion, but I think an average smart person would need more than 20 min or so... so I spent half a day ripping apart his code and watching YouTube. Maybe I wouldn't have done that if he spent 2 hours using Inception as an analogy to spoon-feed recursion to students. My point is... this course is more frustrating than other Udemy courses, but I think I'm also more likely to spend more $$ on this type of course, and am enjoying it more than being spoon-fed. I've increased my rating from 4 to 4.5.
By Cemal Arican on 1/5/2020
If you are new to programming and are interested in Operations Research, this is a good course to follow. This rating probably underrates the content he teaches, the effort put into these lectures are really appreciated and the content it self. But first of all to be honest, your accent makes it hard to concentrate so maybe try to work on that. Its really good that you go over topics in Operations Research. But you go over things quite fast and it would be better to do a step by step approach. Like a code along lecture, so you can build up to more difficult things. Furthermore, maybe implement some notebooks of exercises with a video of solutions to code along and have some explanations. Ill probably increase the rating by the end of the course.
By Nikhil Priyadarsh on 9/25/2019
The explanations were detailed and up to the mark, with concrete implementations of different problems. Overall, it was a great learning experience. This course, along with 'Data Structures and Algorithms in Python' can satisfy all the learning needs of programmers.
By Srishti Gupta on 9/25/2019
felt like prolems are more complicated in the explanation rather than being simplified. can say this because I have completed other similar courses as well. also, unable to understand the code mentioned in resources. hence unable to execute on my own, request your help for it.
By Tarun Sharma on 3/2/2019
This is good for beginner. Good explanation about the Neural Networks. I really like this course and recommend it to others.
Quality Score
No CourseDuck member has rated this course yet. Taken it? Give each part a thumbs up or down.
Overall Score : 92 / 100









