Grokking Algorithms

The basics of Big O notation and how to analyze the time and space complexity of algorithms
Divide and Conquer techniques including Binary Search and Recursion
Dynamic Programming and how to use memorization and tabulation for optimization
Greedy Algorithms and how to make optimal choices
Shortest Path algorithms including Dijkstra's Algorithm and Bellman-Ford Algorithm
NP-Complete problems and how to use approximation algorithms
Advanced Data Structures such as B-Trees, Hash Tables, and more
By the end of this book, you'll have a complete understanding of algorithms and data structures, and you'll be able to apply this knowledge to real-world programming challenges.