Recursion And Backtracking Algorithms In Java

What you'll learn
Recursion
Recursive process
Algorithmic techniques based on recursion
Backtracking Algorithms
Requirements
Basics programming knowledge
A laptop or computer with internet connection
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-- 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 ColoringWhy you should take this course -- Detailed explanation of how recursion worksHow to draw decision tree and translate it into codeContains quiz Ability to ask questions if you don't understand something See you inside :)
Overview
Section 1: 1- String Permutation -- Unique
Lecture 1 String permutation -- no duplicates
Section 2: 2- String Permutation -- Duplicates
Lecture 2 String permutation -- duplicates
Section 3: 3- Array Permutations -- Unique
Lecture 3 Array permutations -- unique
Section 4: 4- Array Permutations -- Duplicates
Lecture 4 Array permutations -- duplicates
Section 5: 5- The Power Set -- Subsets -- unique
Lecture 5 The power set -- subsets -- unique
Section 6: 6- The Power Set -- Subsets -- duplicates
Lecture 6 The power set -- subsets -- duplicates
Section 7: 7- Subset Sum
Lecture 7 Subset Sum
Section 8: 8- Combinations
Lecture 8 Combinations
Section 9: 9- Combination Sum
Lecture 9 Combination sum
Section 10: 10- Combination Sum II
Lecture 10 Combination sum ii
Section 11: 11- Combination Sum III
Lecture 11 Combination sum iii
Section 12: 12- Generate Parentheses
Lecture 12 Generate Parentheses
Section 13: 13- Letter Combinations of a Phone Number
Lecture 13 Letter combinations of a phone number
Section 14: 14- Restore IP Addresses
Lecture 14 Restore IP Addresses
Section 15: 15- Splitting a String Into Descending Consecutive Values
Lecture 15 Splitting a String Into Descending Consecutive Values
Section 16: 16- Max Len of a Concatenated Str with Unique Char
Lecture 16 Max Len of a Concatenated Str with Unique Char
Section 17: 17- Partition to K Equal Sum Subsets
Lecture 17 Partition to K Equal Sum Subsets
Section 18: 19- Matchsticks to Square
Lecture 18 Matchsticks to Square
Section 19: 19- Rat in a Maze
Lecture 19 Rat in a maze
Section 20: 20- M-Coloring
Lecture 20 M-Coloring
Curious to learn programming,Computer science students,Self learning people,Competitive programmer


Homepage

https://www.udemy.com/course/recursion-and-backtracking-algorithms-in-java/

Recursion And Backtracking Algorithms In Java Fast Download
Recursion And Backtracking Algorithms In Java Full Download