Recursion and Backtracking (Memoization, DC, Combinations)

Recursion and Backtracking (Memoization, D&C, Combinations), available at $39.99, has an average rating of 4.55, with 13 lectures, based on 212 reviews, and has 12320 subscribers.

You will learn about 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. This course is ideal for individuals who are Anyone who wants to improve his/her skills in Recursion and Backtracking. or Coders who want to do good in coding interviews. or Struggling students in the topic of Recursion and Backtracking. or Students who want to understand better Dynamic Programming and other Paradigms. or Coders who have just learned a Programming Language. It is particularly useful for Anyone who wants to improve his/her skills in Recursion and Backtracking. or Coders who want to do good in coding interviews. or Struggling students in the topic of Recursion and Backtracking. or Students who want to understand better Dynamic Programming and other Paradigms. or Coders who have just learned a Programming Language.

Enroll now: Recursion and Backtracking (Memoization, D&C, Combinations)

Summary

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

Price: $39.99

Average Rating: 4.55

Number of Lectures: 13

Number of Published Lectures: 13

Number of Curriculum Items: 13

Number of Published Curriculum Objects: 13

Original Price: $22.99

Quality Status: approved

Status: Live

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.

Who Should Attend

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.

Target Audiences

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.

? ? ? ? ? ? ? ?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.

Course Curriculum

Chapter 1: The Source Code

Lecture 1: The Source Code

Chapter 2: Introduction

Lecture 1: Recursion Problems

Lecture 2: Flood Fill Problem

Chapter 3: Divide and Conquer

Lecture 1: Merge Sort

Chapter 4: Exhaustive Search(Backtracking)

Lecture 1: Combinations

Lecture 2: Magnet Chain Problem

Lecture 3: Maze Problem (Simplified)

Chapter 5: Backtracking (The Next Level)

Lecture 1: Gold Collector

Lecture 2: Permutations

Lecture 3: Backtracking

Chapter 6: Backtracking (Practice)

Lecture 1: Maze Problem Revised

Lecture 2: Knight Problem

Lecture 3: N-queens Problem

Instructors

Arbi Elezi
Software Developer | Computer Engineer | Instructor

Rating Distribution

1 stars: 15 votes

2 stars: 9 votes

3 stars: 40 votes

4 stars: 70 votes

5 stars: 78 votes

Frequently Asked Questions

How long do I have access to the course materials?

You can view and review the lecture materials indefinitely, like an on-demand channel.

Can I take my courses with me wherever I go?

Definitely! If you have an internet connection, courses on Udemy are available on any device at any time. If you don’t have an internet connection, some instructors also let their students download course lectures. That’s up to the instructor though, so make sure you get on their good side!