Recursion, Backtracking and Dynamic Programming in Java

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?
• 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
• Sudoku game

Section 6 – DYNAMIC PROGRAMMING

• what is dynamic programming?
• knapsack problem
• 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)
• anagram problem
• palindrome problem
• 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!