• Post category:StudyBullet-14

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

What you will learn

Backtracking Algorithms

Description

Welcome to this course, “Recursion and Backtracking Algorithms in Java”.

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

Get Instant Notification of New Courses on our Telegram channel.

— Combination sum ii

— Combination sum iii

— Generate parentheses

— Letter combination of a phone number

— 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 🙂

English
language

Content

Introduction

1- String Permutation — Unique

String permutation — no duplicates

2- String Permutation — Duplicates

String permutation — duplicates

3- Array Permutations — Unique

Array permutations — unique

4- Array Permutations — Duplicates

Array permutations — duplicates

5- The Power Set — Subsets — unique

The power set — subsets — unique

6- The Power Set — Subsets — duplicates

The power set — subsets — duplicates

Subset Sum

Combinations

Combination sum

10- Combination Sum II

Combination sum ii

11- Combination Sum III

Combination sum iii

12- Generate Parentheses

Generate Parentheses

13- Letter Combinations of a Phone Number

Letter combinations of a phone number

15- Splitting a String Into Descending Consecutive Values

Splitting a String Into Descending Consecutive Values

16- Max Len of a Concatenated Str with Unique Char

Max Len of a Concatenated Str with Unique Char

17- Partition to K Equal Sum Subsets

Partition to K Equal Sum Subsets

19- Matchsticks to Square

Matchsticks to Square

Rat in a maze

M-Coloring