Hands-On Data Structures and Algorithms with Python: Store, manipulate, and access data effectively and boost the performance of your applications, 3rd Edition

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.

Excellent book, very easy and pleasant to read. With this book you will learn concepts of data structures, sorting algorithms, search algorithms, hash tables, etc. Therefore, it is a very pedagogical resource to learn for the first time, or in my case, to reinforce, these concepts, and along the way to become more familiar with the use of the Python language.

The book very good for beginners who wants to learn data structures and algorithm with Python. The book goes through important concepts with easy to understand examples in python along with pretty diagrams and flow charts. Overall a good investment for the future.

One of the best reference book for Python to understand how implementing different data structures and algorithms intelligently can make code and applications more maintainable and efficient It helps to explore functional and reactive implementations of traditional and advanced data structures. It teaches to apply a diverse range of algorithms in your Python code and implement the skills you have learned to maximize the performance of your applications.

Very easy to understand and gives great examples. I’ve learned so much. Very well written!

the book has many typos, or mistakes in explanations... the code snippets are complicated with unnecessary (+/-1) additions to keep the index of elements, while it could be done with a simpler and cleaner code.... thank god for Chat where I get better explanations for things and literally have to cross out things in the book to jot a better code in for practice. if you are looking to learn data structures with this book, I suggest bypassing it and working with an AI to go through code and understand it.

As a CS student I consider myself well versed on Data Structures and Algorithms and this book covers all the top ones you will learn as a student. It goes over many of Pythons built in collections, and covers things like Greedy algorithms, dynamic programming, and even covers time and space complexity showing you how to apply basic principles to better understand how each algorithm may be functioning. I followed along and implemented each of the Data Structs as well as all the algorithms in the book and had a great time doing it. You get to learn all about singly linked lists, doubly linked lists, circular linked lists, as well as Stacks and Queues, Heaps and Priority Queues, different Trees and much more. What was great was that all the examples worked perfectly! Also, I really enjoyed how easy this book was to read. I had a tough time putting it down, it kept me wanting to implement the next DS or Algorithm and that is not easy to pull off as many technical books on the subject are dry and difficult to follow. I have never read the earlier editions, so I am not sure what is new it this edition, but as for the third edition it really covers a ton of material. It was missing a little though such as implementing Trie Data Structures which would have fit nicely in the section on Trees. It also lacked any real projects, which I feel would have been nice to help apply the data structures and algorithms to some real-world examples. It did have simple test cases of course but that is not the same as building an actual project using the stuff we learned. All in all, the book is excellent and is very fun to read. I’d recommend it for beginners on the subject, as well it could be a nice refresher for anyone with more advanced knowledge on the subject.

I liked the book, but why it is all black and white, when even pdf version I have is colored?