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

Algorithm Design Techniques, Backtracking, Divide and Conquer, Memoization, N-queen Problem
Instructed by: Arbi Elezi | Subject: Development, Software Engineering

Description

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. Who is the target audience? Anyone who wants to improve his/her skills in Recursion and Backtracking. Coders who want to do good in coding interviews. Struggling students in the topic of Recursion and Backtracking. Students who want to understand better Dynamic Programming and other Paradigms. Coders who have just learned a Programming Language.

@https%3A%2F%2Fwww.udemy.com%2Frecursion-and-backtracking-memoization-dc-combinations%2F%3Futm_medium=linkshare

Course Info

• 18 Lectures
• 2.5 Hours
• Language: English
• Subject: Development, Software Engineering
• Instructed by: Arbi Elezi
• Platform: Udemy