Recursion, Backtracking and Dynamic Programming in Python [Udemy Coupon Code]

"When you purchase something through one of the links on our site, we may earn an affiliate commission at no additional cost to you."

Limited offer hurry up

Recursion, Backtracking and Dynamic Programming in Python is a top-rated Udemy course taught by Holczer Balazs — with over 11587+ students enrolled since it launched.

Learn Competitive Programming, Recursion, Backtracking, Divide and Conquer Methods and Dynamic Programming in Python

Don’t wait! This special offer won’t last long.

Click the button below to Get up to 100% OFF the regular price.

(The discount will be applied automatically at checkout — no code needed!)

Hurry — this discount on Recursion, Backtracking and Dynamic Programming in Python won’t be around forever. Take action now!

100% off Udemy coupon code

Why enroll in the Recursion, Backtracking and Dynamic Programming in Python Udemy Course?

  • Udemy gives you access to over 250,000 courses and 85,000 expert instructors worldwide.
  • Courses are led by experienced professionals dedicated to delivering a high-quality learning experience.
  • Many of Udemy’s most popular courses have hundreds of thousands of students enrolled.
  • Udemy offers online coupons, promo codes and voucher for the majority of its courses.

Recursion, Backtracking and Dynamic Programming in Python Udemy Promotion code

Course Sections
Introduction
Environment Setup
Recursion
Search Algorithms
Selection Algorithms
Bit Manipulation Problems
Backtracking
Dynamic Programming
Optimal Packing Problem
Divide and Conquer Algorithms
Substring Search Algorithms
COMMON INTERVIEW QUESTIONS (Amazon, Facebook and Google)
Next Steps
### APPENDIX – COMPLEXITY THEORY CRASH COURSE ###
Algorhyme FREE Algorithms Visualizer App
Course Materials (DOWNLOADS)
Course Description
Requirements
Basic 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.
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!