Company: Packt Publishing Author: Vlad Sebastian Ionescu Full Title: Advanced Data Structures And Algorithms In Python Year: 2019 Language: English Genre: Educational: Programming Skill Level: - Price: €124.99 - Files: MP4 (+ Code Files) Time: 04:10:53 Video: AVC, 1920 x 1080 (1.778) at 30.000 fps, 400 kbps Audio: AAC at 122 Kbps, 2 channels, 48.0 KHz Develop new algorithms and solutions to problems by combining advanced algorithms creatively in Python. As a developer, you’ll have certainly heard about various data structures and algorithms. However, have you ever thought profoundly about them and their impact on the performance of your applications? If not, it’s high time to take a look at this topic, and this course is a one-stop guide to master it! This course will teach you the necessary theory and applications to properly understand the advanced algorithms and data structures that are critical to various problems and how to implement them. We’ll also go hands-on and reveal tips and tricks for optimizations, identifying the right approaches and presenting convincing explanations. And, you will get it all in a modern, popular, and well-documented language: Python. Finally, you’ll learn how to develop complex algorithms that are easy to understand, debug, and reusable in various applications. By the end of the course, you’ll know how to develop complex algorithms that are easy to understand, debug, and reusable in various applications. Learn: ✓ Improve your problem-solving skills by learning how to approach some out-of-the-box problems ✓ Develop new algorithms and solutions to problems by combining other algorithms in creative ways ✓ Write clean implementations that significantly improve an algorithm’s runtime by taking advantage of various tips and tricks ✓ Avoid certain misconceptions circulating online by discovering how they (probably) got started and learning how to avoid falling for similar ones in the future ✓ Find out why algorithms are not scary things professors and interviewers use to frighten people Features: ✓ Focus on intuitive explanations and clean implementations ✓ No abstract math and no obfuscated code that offers little insight ✓ Discover how to put together multiple well-known concepts in order to come up with a solution to a problem that you haven’t seen before ✓ Delve into efficient design and implementation techniques to meet your software requirements ✓ Enrich your knowledge of algorithms and data structures by learning concepts that you won’t find as well-organized anywhere else Lessons: 1. Doing a Lot with Very Little 01. The Course Overview 02. From Painfully Slow to Optimal: The Maximum Sum Subarray 03. Find the Factorial with a Given Number of Zeros 04. Find the Given-Length Subarray with the Maximum Minimum 05. Array Problems Involving Modulos 06. Useful Math: The Inclusion-Exclusion Principle 2. More Complex Algorithms on Arrays 07. Rolling Hashes for Constructing a Palindrome 08. Efficiently Counting Subarrays with a Given Sum 09. Binary Searching for an Optimal Subarray Length 10. Manacher's Algorithm 11. Optimizing the Sieve of Eratosthenes 3. General Recursive Algorithms 12. The Towers of Hanoi with Four Pegs 13. Evaluating Arithmetic Expressions with a Recursive Descent Parser 14. Matrix Exponentiation and Fibonacci-Like Functions 15. A Sum of Powers 16. Finding a Permutation with a Given Property 4. Dynamic Programming 17. What Is DP 18. The Minimum Sum Path in a Matrix 19. A More Complex Minimum Sum Path in a Matrix 20. Counting the Number of Ways to Paint a Fence 21. Counting Increasing Subsequences 5. Advanced Dynamic Programming 22. Counting Digit Sums Divisible by d 23. Range Minimum Queries with DP 24. Another Matrix Path Problem 25. Dynamic Programming on Trees 26. TSP and the Held-Karp Algorithm 6. Tree-Based Data Structures 27. Segment Trees and the RMQ Problem 28. Segment Trees with Lazy Updates 29. Binary Indexed Trees 30. Binary Indexed Trees for the RMQ Problem 31. Treaps 7. Graph Theory Algorithms 32. The Lowest Common Ancestor 33. The Shortest Path and Back Our members see more. Join us! ------------- Our members see more. Join us!
