Volume 2 in this series is a comprehensive extension to the exciting common-sense approach that this notorious topic needed. If you’re eager to learn more and dig deeper into how the algorithms and data structures we use daily actually work, this is the book for you!
| → | Michael Pabon |
| Software Engineer, Discord |
Jay has done it again. The second volume of A Common-Sense Guide to Data Structures and Algorithms in Python is every bit as good as the first (which was awesome). These are, without a doubt, the two books on the topic everyone should own.
| → | Lyndon Purcell |
| Software Developer, OK200 Software & Apps |
Authors often lose their readers by overwhelming them from the outset with details and mathematical proofs. In contrast, this book adopts an alternative pedagogical approach. Readers are first introduced to the gist of an algorithm or data structure using cleverly designed illustrations, a hallmark of Jay’s work. Once the reader is adequately prepared, Jay discloses the intricate details and edge cases, laying the grounds for code implementation. This approach shines throughout the book, particularly in the chapter on red-black trees, which is a masterpiece, demonstrating how a complex subject can be taught with clarity and effectiveness.
| → | Ahmad Shahba |
| Lead Software Engineer, Science Systems and Applications, Inc. |
I am such a huge fan of this book as a self-taught developer. It takes a very tricky topic and makes it easy to understand and fun to learn.
| → | Fiohann Shanahan-Dover |
| Software Developer |
Jay sets himself apart as an excellent teacher and author by making a rather complex and obtuse subject (one that is very much needed in a software creation professional’s arsenal) very approachable and enjoyable to study while still going deep.
| → | Paa JAKE |
| Test Engineer, tech11 |
This book explains complex data structure concepts in a very simple and approachable way. You’ll experience many "aha!" moments when you read this book.
| → | Praween Kumar |
| Software Engineer, Cigna |