# Algorithmic Problems in Java (+INTERVIEW QUESTIONS)

## What you'll learn

- Understand backtracking
- Understand dynamic programming
- Understand recursive approaches
- Solve problems from scratch

## Requirements

- 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.

**Section 1:**

what are recursion and recursive methods

linear and binary search

tower of Hanoi problem

**Section 2:**

what are selection algorithms

quickselect algorithm

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

closest pair of points problem

**Section 6:**

top interview questions (Google, Facebook and Amazon)

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**, theory then the concrete examples one by one: fibonacci sequence problem and 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

## Featured review

## Course content

- Preview02:08

## Instructor

Hi!

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!