emilianstoyanov / algorithms-with-python

You will develop your algorithmic thinking skills and acquire skills in working with the main classes of algorithms used in practice: recursion and backtracking, recursion using variables, searching and sorting, as well as graph theory - implementation in computer memory, minimum spanning tree , traversal and finding the shortest path.

• Recursion
• Backtracking
• Recursion vs Iteration
• Searching
• Sorting Algorithms
• Graph ADS
• Traversal algorithms - BFS and DFS
• Connected components
• Topological sort
• Minimum spanning tree (Prim, Kruskal)
• Shortest path (Unweighted graph, Dijkstra, Bellman-Ford)
• Dynamic Programming
• Fibonacci
• Move Down/Right
• Longest common subsequence
• Longest increasing subsequence