101 Algorithms Questions You Must Know: Tricky Questions. Fun Solutions.

by Amrinder Arora

"101 Algorithms Questions You Must Know" presents 101 asymptotic complexity Questions and Answers, Organized by Algorithm Design Techniques. The book is designed as an accompaniment to "Analysis and Design of Algorithms" (ISBN 978-1516513086). The questions are distributed as 9 Warm up Questions on Math Basics 19 Questions on Asymptotic Analysis and Asymptotic Notation 3 Questions on Data Structures 17 Questions on Divide and Conquer 8 Questions on Greedy Algorithms 18 Questions on Dynamic Programming 5 Questions on Graph Traversal (BFS/DFS) 4 Questions on Branch and Bound 9 Questions on NP-Completeness 3 Questions on Lower Bounds, and 6 Questions on Graph Theory

139 pages, Kindle Edition

Published August 14, 2018

Reviews

[William Cruise · Rating 2 out of 5]

This is a companion study guide to Analysis and Design of Algorithms by the same author. Many concepts are not covered thoroughly in this book, but in the main text. Some questions are not even properly answered at all. Would not recommend reading without the main text.