Recursion and Backtracking Algorithms in Java

Recursion and Backtracking Algorithms in Java, available at $69.99, has an average rating of 4.2, with 22 lectures, based on 49 reviews, and has 15946 subscribers.

You will learn about Recursion Recursive process Algorithmic techniques based on recursion Backtracking Algorithms This course is ideal for individuals who are Curious to learn programming or Computer science students or Self learning people or Competitive programmer It is particularly useful for Curious to learn programming or Computer science students or Self learning people or Competitive programmer.

Enroll now: Recursion and Backtracking Algorithms in Java

Summary

Title: Recursion and Backtracking Algorithms in Java

Price: $69.99

Average Rating: 4.2

Number of Lectures: 22

Number of Published Lectures: 22

Number of Curriculum Items: 22

Number of Published Curriculum Objects: 22

Original Price: $39.99

Quality Status: approved

Status: Live

What You Will Learn

Recursion
Recursive process
Algorithmic techniques based on recursion
Backtracking Algorithms

Who Should Attend

Curious to learn programming
Computer science students
Self learning people
Competitive programmer

Target Audiences

Curious to learn programming
Computer science students
Self learning people
Competitive programmer

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

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

Course Curriculum

Chapter 1: Introduction

Lecture 1: Introduction

Lecture 2: Source Code (Revise Daily)

Chapter 2: 1- String Permutation — Unique

Lecture 1: String permutation — no duplicates

Chapter 3: 2- String Permutation — Duplicates

Lecture 1: String permutation — duplicates

Chapter 4: 3- Array Permutations — Unique

Lecture 1: Array permutations — unique

Chapter 5: 4- Array Permutations — Duplicates

Lecture 1: Array permutations — duplicates

Chapter 6: 5- The Power Set — Subsets — unique

Lecture 1: The power set — subsets — unique

Chapter 7: 6- The Power Set — Subsets — duplicates

Lecture 1: The power set — subsets — duplicates

Chapter 8: 7- Subset Sum

Lecture 1: Subset Sum

Chapter 9: 8- Combinations

Lecture 1: Combinations

Chapter 10: 9- Combination Sum

Lecture 1: Combination sum

Chapter 11: 10- Combination Sum II

Lecture 1: Combination sum ii

Chapter 12: 11- Combination Sum III

Lecture 1: Combination sum iii

Chapter 13: 12- Generate Parentheses

Lecture 1: Generate Parentheses

Chapter 14: 13- Letter Combinations of a Phone Number

Lecture 1: Letter combinations of a phone number

Chapter 15: 14- Restore IP Addresses

Lecture 1: Restore IP Addresses

Chapter 16: 15- Splitting a String Into Descending Consecutive Values

Lecture 1: Splitting a String Into Descending Consecutive Values

Chapter 17: 16- Max Len of a Concatenated Str with Unique Char

Lecture 1: Max Len of a Concatenated Str with Unique Char

Chapter 18: 17- Partition to K Equal Sum Subsets

Lecture 1: Partition to K Equal Sum Subsets

Chapter 19: 19- Matchsticks to Square

Lecture 1: Matchsticks to Square

Chapter 20: 19- Rat in a Maze

Lecture 1: Rat in a maze

Chapter 21: 20- M-Coloring

Lecture 1: M-Coloring

Instructors

Md. A. Barik
Software Engineer | Udemy Instructor

Rating Distribution

1 stars: 2 votes
2 stars: 1 votes
3 stars: 3 votes
4 stars: 13 votes
5 stars: 30 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!

Menu