Udemy - Recursion, Backtracking and Dynamic Programming in Python

[OneDDL]

[img]https://i115.fastpic.org/big/2021/0924/b5/fbacf20d52d84e605410ec7996f389b5.jpeg[/img]
MP4 | Video: h264, 1280x720 | Audio: AAC, 44.1 KHz, 2 Ch
Genre: eLearning | Language: English + srt | Duration: 91 lectures (9h 9m) | Size: 1.33 GB
Learn Recursion, Backtracking, Divide and Conquer Methods and Dynamic programming via Examples and Problems in Python

[b]What you'll learn:[/b]
Understanding recursion
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
[b]Requirements[/b]
Basic Python
[b]Description[/b]
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 - RECURSION
what are recursion and recursive methods
stack memory and heap memory overview
what is stack overflow?
Fibonacci numbers
factorial function
tower of Hanoi problem
Section 2 - SEARCH ALGORITHMS
linear search approach
binary search algorithm
Section 3 - SELECTION ALGORITHMS
what are selection algorithms?
how to find the k-th order statistics in O(N) linear running time?
quickselect algorithm
median of medians algorithm
the secretary problem
Section 4 - BACKTRACKING
what is backtracking?
n-queens problem
Hamiltonian cycle problem
coloring problem
knight's tour problem
maze problem
Section 5 - DYNAMIC PROGRAMMING
what is dynamic programming?
knapsack problem
rod cutting problem
subset sum problem
Section 6 - OPTIMAL PACKING
what is optimal packing?
bin packing problem
Section 7 - DIVIDE AND CONQUER APPROACHES
what is the divide and conquer approach?
dynamic programming and divide and conquer method
how to achieve sorting in O(NlogN) with merge sort?
the closest pair of points problem
In 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 Python.
Thanks for joining the course, let's get started!
[b]Who this course is for[/b]
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
Homepage

[code]https://www.udemy.com/course/algorithmic-problems-in-python/[/code]

[code]
https://hot4share.com/iix57gljfdr6/1yz73.Recursion.Backtracking.and.Dynamic.Programming.in.Python.rar.html
[b]Download (Uploadgig)[/b]
https://uploadgig.com/file/download/Fd5916db4e612B83/1yz73.Recursion.Backtracking.and.Dynamic.Programming.in.Python.rar
Download ( Rapidgator )
https://rapidgator.net/file/4528fba1c07b4f092f2905322f0d4d6d/1yz73.Recursion.Backtracking.and.Dynamic.Programming.in.Python.rar.html[/code]

[b]Links are Interchangeable - No Password - Single Extraction[/b]