Algorithmic Problems in Java

Backtracking, dynamic programming, Sudoku, knapsack problem, binpacking, closest pair of points, recursion, monte carlo

Created by Holczer Balazs
Last updated 4/2018
What Will I Learn?
  • Understand backtracking
  • Understand dynamic programming

  • Understand recursive approaches

  • Solve problems from scratch
  • Basic Java

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 research & development.

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.

Who is the target audience?
  • This course is meant for newbies who are not familiar with algorithmic problems in the main or students looking for some refresher
Curriculum For This Course
61 Lectures


Size: 948.21M


Add a Comment

Your email address will not be published. Required fields are marked *