Book on Python, Algorithms, and Data Structures

First Edition - 2014

This is a book about algorithms and data structure in Python. I wrote & open-sourced & sold it to Hanbit Media in 2014.

It's loosely based on the exercises & theory from the book Cracking the Code Interview.

• Here is the PDF for the book.

• Here is the source code, including abstract structures, bitwise operations, builtin Python data structures, searching and sorting, trees, and real interview problems.

• Here are several samplings for coding challenges, including Project Euler, Top Coder, Interview Cake, and the eudyptula challenge.

Even after the years, this book can be useful if you are aiming to learning Python and/or practicing for software engineering interviews.

Second Edition - 2020

The second edition is updated for Python 3. This is a current work on progress.

The Zen of Python

Beautiful is better than ugly.
Explicit is better than implicit.
Simple is better than complex.
Complex is better than complicated.
Flat is better than nested.
Sparse is better than dense.
Readability counts.
Special cases aren't special enough to break the rules.
Although practicality beats purity.
Errors should never pass silently.
Unless explicitly silenced.
In the face of ambiguity, refuse the temptation to guess.
There should be one-- and preferably only one --obvious way to do it.
Although that way may not be obvious at first unless you're Dutch.
Now is better than never.
Although never is often better than *right* now.
If the implementation is hard to explain, it's a bad idea.
If the implementation is easy to explain, it may be a good idea.
Namespaces are one honking great idea -- let's do more of those!

---

This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.