Algorithmic Thinking provides the theoretical background and detailed problem explanations required to stay ahead of our human and robotic competitors.
-Duncan Smith, Senior Software Engineer at Microsoft
In this newly revised edition, Daniel presents a carefully curated collection of challenging programming problems. By deconstructing the problems alongside clear, practical presentations of algorithms and data structures, Algorithmic Thinking will empower you-whether you're looking to get a leg up on technical interviews, enter the world of competitive programming, or just want to sharpen your skills.
-Josh Lospinoso, Ph.D., author of C++ Crash Course
As someone who learnt algorithms from similar problems-oriented books in the early 00s, I believe an updated yet beginner-friendly exposition is long overdue. This book provides implementation-friendly introductions to most building blocks of combinatorial algorithms . . . It's by far the quickest way to get hands-on experience with algorithms, and is also a great supplement to more theoretical expositions.
-Richard Peng, Associate Professor at the University of Waterloo's Cheriton School of Computer Science
Not only does Algorithmic Thinking guide readers on how to approach tackling problems, but Zingaro also helps them understand why these approaches work. With an engaging selection of problems drawn from programming competitions, the book is an excellent guide and an engaging companion for the readers on their learning journey.
-Sushant Sachdeva, Ph.D., Algorithms Professor at the University of Toronto
The step-by-step solution explanations are so detailed that it feels like Daniel is directly teaching us, his readers. This Second Edition is a worthy update to an already excellent text. I particularly like the new chapter on the rarely discussed randomized algorithms. I believe Computer Science students will enjoy reading it as I do.
-Dr Steven Halim, Senior Lecturer at National University of Singapore
The book discusses many interesting problems from programming contests and presents useful techniques that are not often included in algorithm textbooks.
-Antti Laaksonen, University of Helsinki
