When you enroll through our links, we may earn a small commission—at no extra cost to you. This helps keep our platform free and inspires us to add more value.
Recursion and Backtracking (Memoization, D&C, Combinations)
Algorithm Design Techniques, Backtracking, Divide and Conquer, Memoization, N-queen Problem
This Course Includes
udemy
4.5 (213 reviews )
1h 39m 
english
Online - Self Paced
professional certificate
Udemy
About Recursion and Backtracking (Memoization, D&C, Combinations)
If you have trouble understanding Recursion and Backtracking, which is a recursion based technique, then this course is for you, since it is a course solely dedicated to Recursion and All types of Algorithms related to it. In this course the
_Basics of Recursion_
will be learned. The basic
_Algorithm Design_
techniques like
_Divide and Conquer_
,
_Dynamic Programming_
and
_Backtracking_
(Exhaustive Search) will be discussed and many problems related to them will be solved. Many different type of problems will be solved, from the simplest, finding the
_sum of numbers_
, to more difficult ones like
_Combinations, Permutations, Memoizations_
and the famous
_Flood Fill_
and
_N-queen Problem_
.
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..