Recursion and Backtracking Algorithms : Coding Interview [Udemy Coupon Code]

"When you purchase something through one of the links on our site, we may earn an affiliate commission at no additional cost to you."

Limited offer hurry up

Recursion and Backtracking Algorithms : Coding Interview is a top-rated Udemy course taught by Md. A. Barik — with over 15972+ students enrolled since it launched.

Learn how to solve backtracking problem using recursion. Master the art of recursion

Don’t wait! This special offer won’t last long.

Click the button below to Get up to 100% OFF the regular price.

(The discount will be applied automatically at checkout — no code needed!)

Hurry — this discount on Recursion and Backtracking Algorithms : Coding Interview won’t be around forever. Take action now!

100% off Udemy coupon code

Why enroll in the Recursion and Backtracking Algorithms : Coding Interview Udemy Course?

  • Udemy gives you access to over 250,000 courses and 85,000 expert instructors worldwide.
  • Courses are led by experienced professionals dedicated to delivering a high-quality learning experience.
  • Many of Udemy’s most popular courses have hundreds of thousands of students enrolled.
  • Udemy offers online coupons, promo codes and voucher for the majority of its courses.

Recursion and Backtracking Algorithms : Coding Interview Udemy Promotion code

Course Sections
Introduction
1- String Permutation — Unique
2- String Permutation — Duplicates
3- Array Permutations — Unique
4- Array Permutations — Duplicates
5- The Power Set — Subsets — unique
6- The Power Set — Subsets — duplicates
7- Subset Sum
8- Combinations
9- Combination Sum
10- Combination Sum II
11- Combination Sum III
12- Generate Parentheses
13- Letter Combinations of a Phone Number
14- Restore IP Addresses
15- Splitting a String Into Descending Consecutive Values
16- Max Len of a Concatenated Str with Unique Char
17- Partition to K Equal Sum Subsets
19- Matchsticks to Square
19- Rat in a Maze
20- M-Coloring
Course Description
Requirements
Basics programming knowledge
A laptop or computer with internet connection

Welcome to this course, “Recursion and Backtracking Algorithms : Coding Interview”.

This course is about the recursion and backtracking algorithm.  The concept of recursion is simple, but a lot of people struggle with it, finding out base cases and recursive cases. That’s Why I planned to create a course on recursion that explains the underline principles of recursion in details.

By completing this course you will gain confidence in recursion and backtracking algorithms. In this course we will solve most popular and frequently asked backtracking coding interview questions. By mastering these problems you can map almost any type of backtracking problem to these problem.

This course contains —
— What is recursion and how it works
— Permutations of string of unique character
— Permutations of string of duplicates character
— Array permutations of unique elements
— Array permutations of duplicate elements
— Power set of unique elements
— Power set of duplicate elements
— Subset sum
— Combinations
— Combination sum
— Combination sum ii
— Combination sum iii
— Generate parentheses
— Letter combination of a phone number
— Restore ip addresses
— Splitting a string into descending consecutive. value
— Max length of a concatenated str with unique char
— Partition to k equal subset sum
— Matchstick to square
— Rat in a maze
— M Coloring

Why you should take this course —

Detailed explanation of how recursion works

How to draw decision tree and translate it into code

Contains quiz

Ability to ask questions if you don’t understand something

See you inside 🙂