Who Is This Book For?

You may be a professional software engineer of any experience level, a budding computer science student, or a code hobbyist. No matter what box you fit into, if you already know the basics of data structures and algorithms and want to level up, this is the book you’re looking for.

If you’ve already read Volume 1 of this book, you’re ready to dive into this book. (And, welcome back!)

If you haven’t read Volume 1, I won’t take it personally. However, you do need to be pretty familiar with certain topics to comprehend this volume. The topics, in alphabetical order, are these:

Arrays
Big O notation for time and space complexity
Binary search
Binary search trees
Hash tables
Heaps
Recursion
Sorting algorithms (the gist of Selection Sort and Quicksort)

In any case, I make many direct references to Volume 1 throughout this volume, so you can always gain more context if you need to.