Skip to content Skip to sidebar Skip to footer

Recursion, Backtracking and Dynamic Programming in Java


Recursion, Backtracking and Dynamic Programming in 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

Enroll Now

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

Requirements

  • 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?
  • 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!

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

Courses to get you started -- > Recursion, Backtracking and Dynamic Programming in Java

Online Course CoupoNED based Analytics Education Company and aims at Bringing Together the analytics companies and interested Learners.