Disclosure: when you buy through links on our site, we may earn an affiliate commission.

Recursion, Backtracking and Dynamic Programming in Java

Algorithmic Problems in Java with Common Interview Questions (Recursion, Backtracking and Divide and Conquer Algorithms)
4.5
4.5/5
(993 reviews)
10,949 students
Created by

9.4

CourseMarks Score®

9.6

Freshness

8.5

Feedback

9.4

Content

Platform: Udemy
Price: $18.99
Video: 10h 8m
Language: English
Next start: On Demand

Top Java courses:

Detailed Analysis

CourseMarks Score®

9.4 / 10

CourseMarks Score® helps students to find the best classes. We aggregate 18 factors, including freshness, student feedback and content diversity.

Freshness Score

9.6 / 10
This course was last updated on 2/2021.

Course content can become outdated quite quickly. After analysing 71,530 courses, we found that the highest rated courses are updated every year. If a course has not been updated for more than 2 years, you should carefully evaluate the course before enrolling.

Student Feedback

8.5 / 10
We analyzed factors such as the rating (4.5/5) and the ratio between the number of reviews and the number of students, which is a great signal of student commitment.

New courses are hard to evaluate because there are no or just a few student ratings, but Student Feedback Score helps you find great courses even with fewer reviews.

Content Score

9.4 / 10
Video Score: 9.1 / 10
The course includes 10h 8m video content. Courses with more videos usually have a higher average rating. We have found that the sweet spot is 16 hours of video, which is long enough to teach a topic comprehensively, but not overwhelming. Courses over 16 hours of video gets the maximum score.
The average video length is 7 hours 13 minutes of 596 Java courses on Udemy.
Detail Score: 9.3 / 10

The top online course contains a detailed description of the course, what you will learn and also a detailed description about the instructor.

Extra Content Score: 9.9 / 10

Tests, exercises, articles and other resources help students to better understand and deepen their understanding of the topic.

This course contains:

24 articles.
2 resources.
0 exercise.
0 tests or quizzes.

Table of contents

Description

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 – BACKTRACKING
•what is backtracking?
•n-queens problem
•Hamiltonian cycle problem
•coloring problem
•knight’s tour problem
•Sudoku game
Section 5 – DYNAMIC PROGRAMMING
•what is dynamic programming?
•knapsack problem
•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!

You will 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 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

How much does the Recursion, Backtracking and Dynamic Programming in Java course cost? Is it worth it?

The course costs $18.99. And currently there is a 83% discount on the original price of the course, which was $109.99. So you save $91 if you enroll the course now.
The average price is $20.3 of 596 Java courses. So this course is 21% cheaper than the average Java course on Udemy.

Does the Recursion, Backtracking and Dynamic Programming in Java course have a money back guarantee or refund policy?

YES, Recursion, Backtracking and Dynamic Programming in Java has a 30-day money back guarantee. The 30-day refund policy is designed to allow students to study without risk.

Are there any SCHOLARSHIPS for this course?

Currently we could not find a scholarship for the Recursion, Backtracking and Dynamic Programming in Java course, but there is a $91 discount from the original price ($109.99). So the current price is just $18.99.

Who is the instructor? Is Holczer Balazs a SCAM or a TRUSTED instructor?

Holczer Balazs has created 31 courses that got 25,038 reviews which are generally positive. Holczer Balazs has taught 202,001 students and received a 4.5 average review out of 25,038 reviews. Depending on the information available, Holczer Balazs is a TRUSTED instructor.
Software Engineer
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!

9.4

CourseMarks Score®

9.6

Freshness

8.5

Feedback

9.4

Content

Platform: Udemy
Price: $18.99
Video: 10h 8m
Language: English
Next start: On Demand

Students are also interested in

Get this widget on your website (for course creators):

Recursion, Backtracking and Dynamic Programming in Java rating
Copy this code and paste it to your website:
<a href="https://coursemarks.com/course/algorithmic-problems-in-java-interview-questions/" target="_blank" title="Recursion, Backtracking and Dynamic Programming in Java on Coursemarks.com"><img border="0" src="https://coursemarks.com/widget/94.svg" width="200px" alt="Recursion, Backtracking and Dynamic Programming in Java rating"/></a>