Algorithms Notes for Professionals2018 | ISBN: n/a | English | 257 pages | PDF |...
Chapters:
Getting started with algorithms
Algorithm Complexity
Big-O Notation
Trees
Binary Search Trees
Check if a tree is BST or not
Binary Tree traversals
Lowest common ancestor of a Binary Tree
Graph
Graph Traversals
Dijkstra's Algorithm
A* Pathfinding
A* Pathfinding Algorithm
Dynamic Programming
Applications of Dynamic Programming
Kruskal's Algorithm
Greedy Algorithms
Applications of Greedy technique
Prim's Algorithm
Bellman–Ford Algorithm
Line Algorithm
Floyd-Warshall Algorithm
Catalan Number Algorithm
Multithreaded Algorithms
Knuth Morris Pratt (KMP) Algorithm
Edit Distance Dynamic...
