# Algorithmic Problems In Java (+INTERVIEW QUESTIONS)

## Backtracking, dynamic programming, Sudoku, knapsack problem, bin packing, closest pair of points, recursion, monte Carlo

### What you’ll learn

• Understand backtracking
• Also, Understand dynamic programming
• Understand recursive approaches
• Solve problems from scratch

• Basic Java

### Description

This course is about the fundamental concepts of algorithmic problems, focusing on backtracking and dynamic programming. 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. Udemy course free download

#### Section 1:

• what are recursion and recursive methods
• linear and binary search
• Free courses from Udemy
• tower of Hanoi problem

#### Section 2:

• what are selection algorithms
• quickselect algorithm
• Free courses from Udemy
• the secretary problem

#### Section 3:

• what is backtracking
• n-queens problem and Hamiltonian cycle problem
• knight’s tour problem
• Sudoku game

#### Section 4:

• what is dynamic programming
• knapsack problem
• coin change problem and rod cutting problem

#### Section 5:

• bin packing problem
• Free Udemy course
• closest pair of points problem

#### Section 6:

The first chapter is about backtracking: we will talk about problems such as n-queens problem or hamiltonian cycles, coloring problem and Sudoku problem. In the second chapter we will talk about dynamic programming, the theory then the concrete examples one by one: Fibonacci sequence problem and the knapsack 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, EPAM 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