Nandan Vatsyayan
2025/06/06
5 / 5
There are several books available on this topic, 5-7 I have on my bookshelf. Most of them are hard and more theory-oriented.
This is 3rd version in 6 years, WOW! The author has done a fantastic job to simplify topics as much as possible.
This is easy to read, understand and keeps the concepts in mind kind of book. You will learn the essential Python data structures and the most common algorithms within start to finsh.
With this easy-to-understand book, you will experience and learn how to create complex data structures such as linked lists, stacks, heaps, queues, trees, and graphs as well as sorting algorithms including bubble sort, insertion sort, heapsort, and quicksort. We also describe various selection algorithms such as randomized and deterministic selection and provide a detailed discussion of various data structure algorithms and design paradigms such as greedy algorithms, divide-and-conquer, and dynamic programming. In addition, complex data structures such as trees and graphs are explained with easy pictorial examples to understand the concepts of these useful data structures. You will also learn various important string processing and pattern-matching algorithms such as KMP and Boyer-Moore algorithms along with their easy implementation in Python.
This book can be used by any Software developer to get hands dirty on the data structure and algorithm. Very useful for beginner and intermediate programmers and those who want to create a solid foundation.
Now not only FAANG and the tech giants companies ask questions about data structure and algorithms but small and startup companies use the same strategy and 90% of people fail, because of insufficiency of a solid foundation on the topic. This book replenishes that space and makes you more confident in a fun way.
I would recommend this book to anyone who wants to make a foundation on DA&A and I will keep this book in my library forever.
This book would have been more advantageous if the author had counted more problems to solve.
