Recursion, Backtracking and Dynamic Programming in Java
What you'll learn
- Understand recursive approaches
- 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
- Basic Java
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?
tower of Hanoi problem
Section 2 - SEARCH ALGORITHMS
linear search approach
binary search algorithm
Section 3 - SELECTION ALGORITHMS
what are selection algorithms?
how to find the k-th order statistics in O(N) linear running time?
median of medians algorithm
the secretary problem
Section 4 - BIT MANIPULATION PROBLEMS
logical operators and shift operators
checking even and odd numbers
bit length problem
Russian peasant multiplication
Section 5 - BACKTRACKING
what is backtracking?
Hamiltonian cycle problem
knight's tour problem
Section 6 - DYNAMIC PROGRAMMING
what is dynamic programming?
rod cutting problem
subset sum problem
Kadan's algorithm (maximum subarray)
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 - COMMON INTERVIEW QUESTIONS
top interview questions (Google, Facebook and Amazon)
trapping rain water problem
egg dropping problem
dutch national flag problem
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 Java.
Finally, YOU CAN LEARN ABOUT THE MOST COMMON INTERVIEW QUESTIONS (Google, Microsoft, Amazon etc.)
Thanks for joining the course, let's get started!
Who this course is for:
- This course is meant for newbies who are not familiar with algorithmic problems in the main or students looking for some refresher
- Anyone preparing for programming interviews or interested in improving their problem solving skills
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!