coding-interview-university 0,12

A complete computer science study plan to become a software engineer.

Coding Interview University

I originally created this as a short to-do list of study topics for becoming a software engineer, but it grew to the large list you see today. After going through this study plan, I got hired as a Software Development Engineer at Amazon! You probably won’t have to study as much as I did. Anyway, everything you need is here.

The items listed here will prepare you well for in an interview at just about any software company, including the giants: Amazon, Facebook, Google or Microsoft.

Best of luck to you!

Translations: - 中文版本 - Tiếng Việt - Vietnamese - translations in progress: - Español - हिन्दी - עברית - Bahasa Indonesia - Arabic - Turkish - French - Russian - Ukrainian - Brazilian Portuguese - Korean - Telugu - Polish - German - Urdu - Thai - Greek - Italian

What is it?

This is my multi-month study plan for going from web developer (self-taught, no CS degree) to software engineer for a large company.

Coding at the whiteboard - from HBO’s Silicon Valley

This is meant for new software engineers or those switching from software/web development to software engineering (where computer science knowledge is required). If you have many years of experience and are claiming many years of software engineering experience, expect a harder interview.

If you have many years of software/web development experience, note that large software companies like Google, Amazon, Facebook and Microsoft view software engineering as different from software/web development, and they require computer science knowledge.

If you want to be a reliability engineer or systems engineer, study more from the optional list (networking, security).

Table of Contents

—————- Everything below this point is optional —————-

Why use it?

When I started this project, I didn’t know a stack from a heap, didn’t know Big-O anything, anything about trees, or how to traverse a graph. If I had to code a sorting algorithm, I can tell ya it wouldn’t have been very good. Every data structure I’ve ever used was built into the language, and I didn’t know how they worked under the hood at all. I’ve never had to manage memory unless a process I was running would give an “out of memory” error, and then I’d have to find a workaround. I’ve used a few multidimensional arrays in my life and thousands of associative arrays, but I’ve never created data structures from scratch.

It’s a long plan. It may take you months. If you are familiar with a lot of this already it will take you a lot less time.

How to use it

Everything below is an outline, and you should tackle the items in order from top to bottom.

I’m using Github’s special markdown flavor, including tasks lists to check progress.

Create a new branch so you can check items like this, just put an x in the brackets: [x]

Fork a branch and follow the commands below

git checkout -b progress

git remote add jwasham

git fetch --all

Mark all boxes with X after you completed your changes

git add .

git commit -m "Marked x"

git rebase jwasham/master

git push --force

More about Github-flavored markdown

Don’t feel you aren’t smart enough

About Video Resources

Some videos are available only by enrolling in a Coursera, EdX, or class. These are called MOOCs. Sometimes the classes are not in session so you have to wait a couple of months, so you have no access. courses are not free.

I'd appreciate your help to add free and always-available public sources, such as YouTube videos to accompany the online course videos.
I like using university lectures.

Interview Process & General Interview Prep

Pick One Language for the Interview

You can use a language you are comfortable in to do the coding part of the interview, but for large companies, these are solid choices:

  • C++
  • Java
  • Python

You could also use these, but read around first. There may be caveats:

  • JavaScript
  • Ruby

You need to be very comfortable in the language and be knowledgeable.

Read more about choices: - -

See language resources here

You’ll see some C, C++, and Python learning included below, because I’m learning. There are a few books involved, see the bottom.

Book List

This is a shorter list than what I used. This is abbreviated to save you time.

Interview Prep

If you have tons of extra time:

Computer Architecture

If short on time:

  • [ ] Write Great Code: Volume 1: Understanding the Machine
    • The book was published in 2004, and is somewhat outdated, but it’s a terrific resource for understanding a computer in brief.
    • The author invented HLA, so take mentions and examples in HLA with a grain of salt. Not widely used, but decent examples of what assembly looks like.
    • These chapters are worth the read to give you a nice foundation:
      • Chapter 2 - Numeric Representation
      • Chapter 3 - Binary Arithmetic and Bit Operations
      • Chapter 4 - Floating-Point Representation
      • Chapter 5 - Character Representation
      • Chapter 6 - Memory Organization and Access
      • Chapter 7 - Composite Data Types and Memory Objects
      • Chapter 9 - CPU Architecture
      • Chapter 10 - Instruction Set Architecture
      • Chapter 11 - Memory Architecture and Organization

If you have more time (I want this book):

Language Specific

You need to choose a language for the interview (see above). Here are my recommendations by language. I don’t have resources for all languages. I welcome additions.

If you read though one of these, you should have all the data structures and algorithms knowledge you’ll need to start doing coding problems. You can skip all the video lectures in this project, unless you’d like a review.

Additional language-specific resources here.


I haven’t read these two, but they are highly rated and written by Sedgewick. He’s awesome.

If you have a better recommendation for C++, please let me know. Looking for a comprehensive resource.



  • [ ] Data Structures and Algorithms in Java
    • by Goodrich, Tamassia, Goldwasser
    • used as optional text for CS intro course at UC Berkeley
    • see my book report on the Python version below. This book covers the same topics.


Optional Books

Some people recommend these, but I think it’s going overboard, unless you have many years of software engineering experience and expect a much harder interview:

  • [ ] Algorithm Design Manual (Skiena)

    • As a review and problem recognition
    • The algorithm catalog portion is well beyond the scope of difficulty you’ll get in an interview.
    • This book has 2 parts:
      • class textbook on data structures and algorithms
        • pros:
          • is a good review as any algorithms textbook would be
          • nice stories from his experiences solving problems in industry and academia
          • code examples in C
        • cons:
          • can be as dense or impenetrable as CLRS, and in some cases, CLRS may be a better alternative for some subjects
          • chapters 7, 8, 9 can be painful to try to follow, as some items are not explained well or require more brain than I have
          • don’t get me wrong: I like Skiena, his teaching style, and mannerisms, but I may not be Stony Brook material.
      • algorithm catalog:
        • this is the real reason you buy this book.
        • about to get to this part. Will update here once I’ve made my way through it.
    • Can rent it on kindle
    • is a great resource for textbooks at good prices.
    • Answers:
    • Errata
  • [ ] Introduction to Algorithms

    • Important: Reading this book will only have limited value. This book is a great review of algorithms and data structures, but won’t teach you how to write good code. You have to be able to code a decent solution efficiently.
    • is a great resource for textbooks at good prices.
    • aka CLR, sometimes CLRS, because Stein was late to the game
  • [ ] Programming Pearls

    • The first couple of chapters present clever solutions to programming problems (some very old using data tape) but that is just an intro. This a guidebook on program design and architecture, much like Code Complete, but much shorter.
  • “Algorithms and Programming: Problems and Solutions” by Shen

    • A fine book, but after working through problems on several pages I got frustrated with the Pascal, do while loops, 1-indexed arrays, and unclear post-condition satisfaction results.
    • Would rather spend time on coding problems from another book or online coding problems.

Before you Get Started

This list grew over many months, and yes, it kind of got out of hand.

Here are some mistakes I made so you’ll have a better experience.

1. You Won’t Remember it All

I watched hours of videos and took copious notes, and months later there was much I didn’t remember. I spent 3 days going through my notes and making flashcards so I could review.

Read please so you won’t make my mistakes:

Retaining Computer Science Knowledge

2. Use Flashcards

To solve the problem, I made a little flashcards site where I could add flashcards of 2 types: general and code. Each card has different formatting.

I made a mobile-first website so I could review on my phone and tablet, wherever I am.

Make your own for free:

Keep in mind I went overboard and have cards covering everything from assembly language and Python trivia to machine learning and statistics. It’s way too much for what’s required.

Note on flashcards: The first time you recognize you know the answer, don’t mark it as known. You have to see the same card and answer it several times correctly before you really know it. Repetition will put that knowledge deeper in your brain.

An alternative to using my flashcard site is Anki, which has been recommended to me numerous times. It uses a repetition system to help you remember. It’s user-friendly, available on all platforms and has a cloud sync system. It costs $25 on iOS but is free on other platforms.

My flashcard database in Anki format: (thanks @xiewenya)

3. Review, review, review

I keep a set of cheat sheets on ASCII, OSI stack, Big-O notations, and more. I study them when I have some spare time.

Take a break from programming problems for a half hour and go through your flashcards.

4. Focus

There are a lot of distractions that can take up valuable time. Focus and concentration are hard.

What you won’t see covered

These are prevalent technologies but not part of this study plan:

  • SQL
  • Javascript
  • HTML, CSS, and other front-end technologies

The Daily Plan

Some subjects take one day, and some will take multiple days. Some are just learning with nothing to implement.

Each day I take one subject from the list below, watch videos about that subject, and write an implementation in: - C - using structs and functions that take a struct * and something else as args. - C++ - without using built-in types - C++ - using built-in types, like STL’s std::list for a linked list - Python - using built-in types (to keep practicing Python) - and write tests to ensure I’m doing it right, sometimes just using simple assert() statements - You may do Java or something else, this is just my thing.

You don’t need all these. You need only one language for the interview.

Why code in all of these? - Practice, practice, practice, until I’m sick of it, and can do it with no problem (some have many edge cases and bookkeeping details to remember) - Work within the raw constraints (allocating/freeing memory without help of garbage collection (except Python)) - Make use of built-in types so I have experience using the built-in tools for real-world use (not going to write my own linked list implementation in production)

I may not have time to do all of these for every subject, but I’ll try.

You can see my code here: - C - C++ - Python

You don’t need to memorize the guts of every algorithm.

Write code on a whiteboard or paper, not a computer. Test with some sample inputs. Then test it out on a computer.

Prerequisite Knowledge

Algorithmic complexity / Big-O / Asymptotic analysis

Data Structures

More Knowledge



As a summary, here is a visual representation of 15 sorting algorithms. If you need more detail on this subject, see “Sorting” section in Additional Detail on Some Subjects


Graphs can be used to represent many problems in computer science, so this section is long, like trees and sorting were.

You’ll get more graph practice in Skiena’s book (see Books section below) and the interview books

Even More Knowledge