Learn Competitive Programming, Recursion, Backtracking, Divide and Conquer Methods and Dynamic Programming in Python
InstructorHolczer Balazs
The curriculum spans diverse areas including bit manipulation, selection algorithms, and substring search techniques.
Editorial course preview
This view highlights a concrete, legible example from the course presentation.
This slide illustrates recursion using the Tower of Hanoi problem, showing disk movement on pegs alongside the corresponding Python function definition and execution stack.
Instruction includes simulations of stack and heap memory to explain how recursion interacts with system memory.
One signal from 2020 suggests the instruction focuses heavily on theoretical discussion rather than hands-on coding-along; this signal predates the displayed course update, and while the update may have addressed it, the update label does not prove that it was corrected.
A signal from 2022 identified technical inaccuracies in recursive function logic and naming; however, the 2025 update label does not prove these were corrected.
One sampled review suggests that a signal from 2022 noted the presence of Java code in a section intended for Python learners; the 2025 update label does not prove this was addressed.
The curriculum aligns with the target of interview preparation and basic Python knowledge.