Recursion and Backtracking (Memoization, D&C, Combinations)

Algorithm Design Techniques, Backtracking, Divide and Conquer, Memoization, N-queen Problem
4.24 (212 reviews)
Udemy
platform
English
language
Software Engineering
category
Arbi Elezi
instructor
Recursion and Backtracking (Memoization, D&C, Combinations)
12 327
students
1.5 hours
content
May 2019
last update
$199.99
regular price

What you will learn

You will be able to solve almost any problem involving recursion or at least easily understand the logic behind it.

You will learn Backtracking and be able to solve famous Backtracking problems that may be asked in the coding interviews.

You will have the sufficient knowledge and skill to easily understand and learn Data Structures and Algorithms.

You will learn how to create and solve problems having to do with Recurrence Relations.

You will learn the Basics of Programming Paradigms such as Dynamic Programming, Divide and Conquer and Backtracking.

Course Gallery

Recursion and Backtracking (Memoization, D&C, Combinations) – Screenshot 1
Screenshot 1 – Recursion and Backtracking (Memoization, D&C, Combinations)
Recursion and Backtracking (Memoization, D&C, Combinations) – Screenshot 2
Screenshot 2 – Recursion and Backtracking (Memoization, D&C, Combinations)
Recursion and Backtracking (Memoization, D&C, Combinations) – Screenshot 3
Screenshot 3 – Recursion and Backtracking (Memoization, D&C, Combinations)
Recursion and Backtracking (Memoization, D&C, Combinations) – Screenshot 4
Screenshot 4 – Recursion and Backtracking (Memoization, D&C, Combinations)

Charts

Students
Price
Rating & Reviews
Enrollment Distribution
Related Topics
1897852
udemy ID
06/09/2018
course created date
23/05/2019
course indexed date
Bot
course submited by