Recursion, Backtracking and Dynamic Programming in Java
- 4.5
-
![]()
![]()
![]()
![]()
![]()
Brief Introduction
Algorithmic Problems in Java with Common Interview Questions (Recursion, Backtracking and Divide and Conquer Algorithms)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!
Requirements
- Requirements
- Basic Java
Holczer Balazs
4.5 Raiting
Data Structures and Algorithms In Java for Coding Interview
- 4.1
-
![]()
![]()
![]()
![]()
![]()
Data Structures and Algorithms in Java to crack Coding Interview Using Data Structures Algorithms Master Java Algorithms Closed Captioning for rest of the sections is in progress....
Introduction to Programming and App Development
- 3.7
-
![]()
![]()
![]()
![]()
![]()
for Android and iOS Highlights Overview This is an introduction to programming and app development class series, partly based on an upper-division undergraduate introductory programming languages course from the Computer Science department at UCLA....
Recursion, Backtracking and Dynamic Programming in Java
- 4.5
-
![]()
![]()
![]()
![]()
![]()
Algorithmic Problems in Java with Common Interview Questions (Recursion, Backtracking and Divide and Conquer Algorithms) Section 1 - RECURSION what are recursion and recursive methods...
Computer Science: Programming with a Purpose
- 4.7
-
![]()
![]()
![]()
![]()
![]()
The basis for education in the last millennium was “reading, writing, and arithmetic;” now it is reading, writing, and computing. Then, we present a modern introduction to object-oriented programming....
