Grokking Algorithms, Second Edition product image

Grokking Algorithms, Second Edition

(5/5)
Review by Joshua Morris on
View on Amazon

Review

I revisited Grokking Algorithms, Second Edition this year while mentoring a cohort of bootcamp graduates, and it remains the most approachable algorithms primer I’ve ever handed out. The refreshed chapters weave in modern examples—Dijkstra’s for delivery routing, bloom filters for caching, union-find for social graphs—while the doodled walkthroughs keep every step approachable. We paired the recursion and dynamic programming chapters with short coding katas, and even the students who fear math were sketching state tables and big-O trade-offs by the end of the week. Manning added new drill problems and QR-linked animations, so it’s easy to reinforce each concept with exercises. You won’t get the depth of CLRS or The Algorithm Design Manual, but as a gateway resource for engineers moving from CRUD apps to performance-aware code, it’s still unbeatable.

✓ Pros

  • Cartoon-style diagrams clarify recursion, graphs, and DP without intimidation
  • Modern case studies (delivery routing, caching, ranking) keep examples relevant
  • End-of-chapter drills and QR-linked videos reinforce each concept
  • Perfect stepping stone before heavier algorithm texts
  • Great mentoring aid when onboarding juniors or bootcamp grads

✗ Cons

  • Skims over rigorous proofs - advanced readers will still need a deeper text
  • Focuses on high-level intuition, so code samples stay in Python and JS

Specifications

Pages320
Edition2nd
PublisherManning Publications
LanguageEnglish
FormatPaperback
Isbn13978-1633438538
Publication DateMarch 26, 2024