jwasham/coding-interview-university

★ 346,224Audience · vibe coderComplexity · 1/5License

Mindmap

mindmap
  root((repo))
    Core Topics
      Data structures
      Algorithms
      Complexity analysis
    Interview Prep
      Resume tips
      Interview process
      Post-hire advice
    Advanced Topics
      System design
      Dynamic programming
      Graph algorithms
    Use Cases
      Self-study plan
      Interview preparation
      CS fundamentals review
    Audience
      Career changers
      Self-taught engineers
      Interview candidates

mindmap root((repo)) Core Topics Data structures Algorithms Complexity analysis Interview Prep Resume tips Interview process Post-hire advice Advanced Topics System design Dynamic programming Graph algorithms Use Cases Self-study plan Interview preparation CS fundamentals review Audience Career changers Self-taught engineers Interview candidates

Things people build with this

USE CASE 1

Study a structured curriculum to prepare for technical interviews at Amazon, Google, Facebook, or Microsoft.

USE CASE 2

Learn core computer science fundamentals like data structures, algorithms, and Big-O complexity at your own pace.

USE CASE 3

Get resume and interview process advice tailored to landing roles at large tech companies.

USE CASE 4

Review advanced topics like system design, dynamic programming, and graph algorithms before interviews.

Free to use and share for any purpose, including commercial use, with attribution to the original author.

In plain English

Coding Interview University is a multi-month self-study plan for becoming a software engineer at a large company. The author wrote in the README that he originally created it as a short to-do list of study topics, that it grew much larger over time, and that following it helped him get hired at Amazon. He notes he studied 8-12 hours a day for several months but says readers do not need to study as much. The plan targets interviews at companies including Amazon, Facebook, Google, and Microsoft.

The way it works is that the README is a long, structured curriculum the learner works through in order. Required prerequisites are a little coding experience, patience, and time. The plan covers algorithmic complexity and Big-O; core data structures including arrays, linked lists, stacks, queues, and hash tables; trees including binary search trees, heaps, and traversals; classic sorting algorithms; graphs and traversals; recursion, dynamic programming, design patterns, combinatorics and probability, NP-completeness, caches, processes and threads, testing, string searching, tries, floating-point numbers, Unicode, endianness, and networking. There is also a "Getting the Job" section covering resume, interview process, and post-hire advice, plus an optional extras list including system design, compilers, cryptography, and topics like Bloom filters and HyperLogLog.

Someone would use this when they want a structured, free path to prepare for a software engineering interview at a large tech company, or a roadmap of the computer science fundamentals expected at that bar. The README is offered in many community-translated languages. The full README is longer than what was provided.

Copy-paste prompts

Prompt 1

I'm preparing for a software engineering interview at a big tech company. Walk me through the data structures section of Coding Interview University and give me practice problems for each one.

Prompt 2

Create a 12-week study schedule based on Coding Interview University's curriculum that I can follow for 2 hours a day.

Prompt 3

Explain Big-O complexity and algorithmic analysis using examples from Coding Interview University's approach.

Prompt 4

What are the most important topics from Coding Interview University I should focus on if I only have 4 weeks to prepare?

Prompt 5

Generate mock interview questions covering trees, graphs, and dynamic programming based on Coding Interview University's scope.

Open on GitHub → Explain another repo

Generated 2026-05-18 · Model: sonnet-4-6 · Verify against the repo before relying on details.