Language: English (US)

Algorithms with Python for efficient coding and problem-solving skills

https://www.udemy.com/course/python-algorithms-masterclass/

"Python Algorithms Masterclass" is a fundamental course for any developer who wants to solve complex problems effectively.

In this course, you will systematically learn various algorithmic problems and how to implement them efficiently using Python so that you can apply them immediately in your work.

Develop your ability to combine mathematical and computational thinking to design better performing algorithms, and even master how to analyze performance to choose the optimal solution!

The "Python Algorithms Masterclass" course is the best choice for anyone who wants to learn how to solve problems quickly and accurately in the real world.

In the “Python Algorithms Masterclass” course,

(POINT 1) You will learn a variety of topics from basic concepts of problem-solving to advanced algorithms.

(POINT 2) You will learn theory and practice simultaneously through various practical problems, and gain experience in implementing them yourself using Python.

(POINT 3) You will learn how to understand and analyze the time complexity and space complexity of algorithms to improve their performance.

(POINT 4) You will challenge yourself with difficult problems by gradually increasing the difficulty level from basic to advanced.

1. Introduction to Problem-Solving: Learn the basic concept of problem-solving, how to input and output data, and write problem-solving strategies in code.

2. Recursion: Learn the basic concept of recursion and efficiently solve problems such as Euclidean algorithm to find the greatest common divisor, Collatz conjecture, Tower of Hanoi, permutations, Fibonacci sequence, and more.

3. Sort: Learn the basic concept of sorting algorithms and efficiently solve problems such as word sorting, coordinate sorting, median elimination, determining anagrams, bubble sorting, insertion sorting, and more.

4. Sequential Search: Learn the basic concept of sequential search and efficiently solve problems such as locating elements, Palindrome numbers, Eratosthenes' sieve, building triangles, and more.

5. Binary Search: Learn the basic concept of binary seacrch and efficiently solve problems such as locating elements, playing twenty questions game, the batonic sequence, cutting trees, and more.

6. Stack: Learn the basic concept of a stack and efficiently solve problems such as visible sticks, postfix operations and transformations, stacked sequences, and more.

7. Queue and Heap: Learn the concept of a queue and a deque and efficiently solve problems such as changing median, Josephus, and more.

8. Hash Tables: Learn the basic concepts of a hash table and efficiently solve problems such as sums of two elements, Roman numeral conversion, and more.

9. Divide-and-Conquer 1: Learn the basic concept of divide and conquer and efficiently solve problems involving power of integer and matrice, quadtree, and more.

10. Divide-and-Conquer 2: Efficiently solve problems such as dividing and sorting a given list by a pivot.

11. Dynamic Programming 1: Learn the basic concept of dynamic programming and efficiently solve problems such as Fibonacci numbers, 2 x N Tiling, stair climbing, making it 1, finding the optimal value and the optimal solution simultaneously, and more.

12. Dynamic Programming 2: Efficiently solve problems such as how to compute binomial coefficients, paths on triangles, sequence of final common parts, and more.

13. Greedy approach: Learn the basic concept of the greedy approach and efficiently solve problems such as coin exchange, room assignment, and more.

14. DFS and BFS: Learn the basic concept of Depth-First Search and Breadth-First Search and efficiently solve problems such as a number of islands, maze navigation, and more.

15. Backtracking: Learn the basic concept of backtracking and use backtracking to efficiently solve problems such as N-Queens, and more.

16. Tree: Learn the basic concept of trees and binary trees and efficiently solve problems such as traversal of binary trees, reconstruction of binary trees, and more.

17. Graph: Learn the basic concept of graphs and efficiently solve problems such as Union-Find and finding the minimum height tree using the Kruskal algorithm, and more.

18. Shortest Paths: Learn the Daixtra and Floyd algorithms and efficiently solve problems such as finding the cost of the shortest path and finding the shortest path of all pairs.

19. Knapsack Problem: Efficiently solve problems such as the divisible knapsack problem using Griddy strategies and dynamic programming.

20. Computational Complexity: Learn computational complexity through the selection problem, and understand the basic concept of NP-Theory, NP-Complete, and NP-Hard problems.