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 – BACKTRACKING
•what is backtracking?
•Hamiltonian cycle problem
•knight’s tour problem
Section 5 – DYNAMIC PROGRAMMING
•what is dynamic programming?
•rod cutting problem
•subset sum problem
Section 6 – OPTIMAL PACKING
•what is optimal packing?
•bin packing problem
Section 7 – 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 8 – COMMON INTERVIEW QUESTIONS
•top interview questions (Google, Facebook and Amazon)
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!