Recursion, Backtracking And Dynamic Programming In Java
Recursion, Backtracking And Dynamic Programming In Java
MP4 | Video: h264, 1280x720 | Audio: AAC, 44.1 KHz
Language: English (US) | Size: 2.22 GB | Duration: 14h 46m
Competitive Programming with Common Interview Questions (Recursion, Backtracking and Divide and Conquer Algorithms)
What you'll learn
Understand recursive approaches
Understand backtracking
Understand dynamic programming
Understand divide and conquer methods
Implement 15+ algorithmic problems from scratch
Improve your problem solving skills and become a stronger developer
Requirements
Basic Java
Description
This course is about the fundamental concepts of algorithmic problems focusing on recursion, backtracking, dynamic programming and divide and conquer approaches. As far as I am concerned, these techniques are very important nowadays, algorithms can be used (and have several applications) in several fields from software engineering to investment banking or R&D.Section 1 - RECURSIONwhat are recursion and recursive methodsstack memory and heap memory overviewwhat is stack overflow?Fibonacci numbersfactorial functiontower of Hanoi problemSection 2 - SEARCH ALGORITHMSlinear search approachbinary search algorithmSection 3 - SELECTION ALGORITHMSwhat are selection algorithms?how to find the k-th order statistics in O(N) linear running time?quickselect algorithmmedian of medians algorithmthe secretary problemSection 4 - BIT MANIPULATION PROBLEMSbinary numberslogical operators and shift operatorschecking even and odd numbersbit length problemRussian peasant multiplicationSection 5 - BACKTRACKINGwhat is backtracking?n-queens problemHamiltonian cycle problemcoloring problemknight's tour problemSudoku gameSection 6 - DYNAMIC PROGRAMMINGwhat is dynamic programming?knapsack problemrod cutting problemsubset sum problemKadan's algorithm (maximum subarray)longest common subsequence (LCS) problem Section 7 - OPTIMAL PACKING what is optimal packing?bin packing problemSection 8 - DIVIDE AND CONQUER APPROACHESwhat is the divide and conquer approach?dynamic programming and divide and conquer methodhow to achieve sorting in O(NlogN) with merge sort?the closest pair of points problemSection 9 - COMMON INTERVIEW QUESTIONStop interview questions (Google, Facebook and Amazon)anagram problempalindrome problemtrapping rain water problemegg dropping problemdutch national flag problemIn each section we will talk about the theoretical background for all of these algorithms then we are going to implement these problems together from scratch in Java.Finally, YOU CAN LEARN ABOUT THE MOST COMMON INTERVIEW QUESTIONS (Google, Microsoft, Amazon etc.)Thanks for joining the course, let's get started!
Who this course is for:
This course is meant for newbies who are not familiar with algorithmic problems in the main or students looking for some refresher,Anyone preparing for programming interviews or interested in improving their problem solving skills
For More Courses Visit & Bookmark Your Preferred Language Blog
From Here: - - - - - - - -
What you'll learn
Understand recursive approaches
Understand backtracking
Understand dynamic programming
Understand divide and conquer methods
Implement 15+ algorithmic problems from scratch
Improve your problem solving skills and become a stronger developer
Requirements
Basic Java
Description
This course is about the fundamental concepts of algorithmic problems focusing on recursion, backtracking, dynamic programming and divide and conquer approaches. As far as I am concerned, these techniques are very important nowadays, algorithms can be used (and have several applications) in several fields from software engineering to investment banking or R&D.Section 1 - RECURSIONwhat are recursion and recursive methodsstack memory and heap memory overviewwhat is stack overflow?Fibonacci numbersfactorial functiontower of Hanoi problemSection 2 - SEARCH ALGORITHMSlinear search approachbinary search algorithmSection 3 - SELECTION ALGORITHMSwhat are selection algorithms?how to find the k-th order statistics in O(N) linear running time?quickselect algorithmmedian of medians algorithmthe secretary problemSection 4 - BIT MANIPULATION PROBLEMSbinary numberslogical operators and shift operatorschecking even and odd numbersbit length problemRussian peasant multiplicationSection 5 - BACKTRACKINGwhat is backtracking?n-queens problemHamiltonian cycle problemcoloring problemknight's tour problemSudoku gameSection 6 - DYNAMIC PROGRAMMINGwhat is dynamic programming?knapsack problemrod cutting problemsubset sum problemKadan's algorithm (maximum subarray)longest common subsequence (LCS) problem Section 7 - OPTIMAL PACKING what is optimal packing?bin packing problemSection 8 - DIVIDE AND CONQUER APPROACHESwhat is the divide and conquer approach?dynamic programming and divide and conquer methodhow to achieve sorting in O(NlogN) with merge sort?the closest pair of points problemSection 9 - COMMON INTERVIEW QUESTIONStop interview questions (Google, Facebook and Amazon)anagram problempalindrome problemtrapping rain water problemegg dropping problemdutch national flag problemIn each section we will talk about the theoretical background for all of these algorithms then we are going to implement these problems together from scratch in Java.Finally, YOU CAN LEARN ABOUT THE MOST COMMON INTERVIEW QUESTIONS (Google, Microsoft, Amazon etc.)Thanks for joining the course, let's get started!
Who this course is for:
This course is meant for newbies who are not familiar with algorithmic problems in the main or students looking for some refresher,Anyone preparing for programming interviews or interested in improving their problem solving skills
For More Courses Visit & Bookmark Your Preferred Language Blog
From Here: - - - - - - - -
