You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
The reason will be displayed to describe this comment to others. Learn more.
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.
This is my multi-month study plan for going from web developer (self-taught, no CS degree) to software engineer for a large company.
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 operations engineer, study more from the optional list (networking, security).
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]
Some videos are available only by enrolling in a Coursera, EdX, or Lynda.com 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. Lynda.com 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.
For a richer, more up-to-date (2011), but longer treatment
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.
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:
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.
aka CLR, sometimes CLRS, because Stein was late to the game
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.
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.
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.
This is a short book, but it will give you a great handle on the C language and if you practice it a little
you'll quickly get proficient. Understanding C helps you understand how programs and memory work.
Gotcha: you need pointer to pointer knowledge:
(for when you pass a pointer to a function that may change the address where that pointer points)
This page is just to get a grasp on ptr to ptr. I don't recommend this list traversal style. Readability and maintainability suffer due to cleverness.
dequeue() - returns value and removes least recently added element (front)
empty()
Implement using fixed-sized array:
enqueue(value) - adds item at end of available storage
dequeue() - returns value and removes least recently added element
empty()
full()
Cost:
a bad implementation using linked list where you enqueue at head and dequeue at tail would be O(n)
because you'd need the next to last element, causing a full traversal each dequeue
enqueue: O(1) (amortized, linked list and array [probing])
Know about the most famous classes of NP-complete problems, such as traveling salesman and the knapsack problem,
and be able to recognize them when an interviewer asks you them in disguise.
Reading all from end to end with full comprehension will likely take more time than you have. I recommend being selective on papers and their sections.
You can expect system design questions if you have 4+ years of experience.
Scalability and System Design are very large topics with many topics and resources, since
there is a lot to consider when designing a software/hardware system that can scale.
Expect to spend quite a bit of time on this.
For even more, see "Mining Massive Datasets" video series in the Video Series section.
Practicing the system design process: Here are some ideas to try working through on paper, each with some documentation on how it was handled in the real world:
This section will have shorter videos that you can watch pretty quickly to review most of the important concepts.
It's nice if you want a refresher often.
Series of 2-3 minutes short subject videos (23 videos)
Now that you know all the computer science topics above, it's time to practice answering coding problems.
Coding question practice is not about memorizing answers to programming problems.
Why you need to practice doing programming problems:
problem recognition, and where the right data structures and algorithms fit in
gathering requirements for the problem
talking your way through the problem like you will in the interview
coding on a whiteboard or paper, not a computer
coming up with time and space complexity for your solutions
testing your solutions
There is a great intro for methodical, communicative problem solving in an interview. You'll get this from the programming
interview books, too, but I found this outstanding: Algorithm design canvas
No whiteboard at home? That makes sense. I'm a weirdo and have a big whiteboard. Instead of a whiteboard, pick up a
large drawing pad from an art store. You can sit on the couch and practice. This is my "sofa whiteboard".
I added the pen in the photo for scale. If you use a pen, you'll wish you could erase. Gets messy quick.
See Resume prep items in Cracking The Coding Interview and back of Programming Interviews Exposed
Be thinking of for when the interview comes
Think of about 20 interview questions you'll get, along with the lines of the items below. Have 2-3 answers for each.
Have a story, not just data, about something you accomplished.
Why do you want this job?
What's a tough problem you've solved?
Biggest challenges faced?
Best/worst designs seen?
Ideas for improving an existing product.
How do you work best, as an individual and as part of a team?
Which of your skills or experiences would be assets in the role and why?
What did you most enjoy at [job x / project y]?
What was the biggest challenge you faced at [job x / project y]?
What was the hardest bug you faced at [job x / project y]?
What did you learn at [job x / project y]?
What would you have done better at [job x / project y]?
Have questions for the interviewer
Some of mine (I already may know answer to but want their opinion or team perspective):
How large is your team?
What does your dev cycle look like? Do you do waterfall/sprints/agile?
Are rushes to deadlines common? Or is there flexibility?
How are decisions made in your team?
How many meetings do you have per week?
Do you feel your work environment helps you concentrate?
What are you working on?
What do you like about it?
What is the work life like?
Once You've Got The Job
Congratulations!
Keep learning.
You're never really done.
*****************************************************************************************************
*****************************************************************************************************
Everything below this point is optional.
By studying these, you'll get greater exposure to more CS concepts, and will be better prepared for
any software engineering job. You'll be a much more well-rounded software engineer.
*****************************************************************************************************
*****************************************************************************************************
These topics will likely not come up in an interview, but I added them to help you become a well-rounded
software engineer, and to be aware of certain technologies and algorithms, so you'll have a bigger toolbox.
Know least one type of balanced binary tree (and know how it's implemented):
"Among balanced search trees, AVL and 2/3 trees are now passé, and red-black trees seem to be more popular.
A particularly interesting self-organizing data structure is the splay tree, which uses rotations
to move any accessed key to the root." - Skiena
Of these, I chose to implement a splay tree. From what I've read, you won't implement a
balanced search tree in your interview. But I wanted exposure to coding one up
and let's face it, splay trees are the bee's knees. I did read a lot of red-black tree code.
splay tree: insert, search, delete functions
If you end up implementing red/black tree try just these:
search and insertion functions, skipping delete
I want to learn more about B-Tree since it's used so widely with very large data sets.
In practice:
From what I can tell, these aren't used much in practice, but I could see where they would be:
The AVL tree is another structure supporting O(log n) search, insertion, and removal. It is more rigidly
balanced than red–black trees, leading to slower insertion and removal but faster retrieval. This makes it
attractive for data structures that may be built once and loaded without reconstruction, such as language
dictionaries (or program dictionaries, such as the opcodes of an assembler or interpreter).
In practice:
Splay trees are typically used in the implementation of caches, memory allocators, routers, garbage collectors,
data compression, ropes (replacement of string used for long text strings), in Windows NT (in the virtual memory,
networking and file system code) etc.
In practice:
Red–black trees offer worst-case guarantees for insertion time, deletion time, and search time.
Not only does this make them valuable in time-sensitive applications such as real-time applications,
but it makes them valuable building blocks in other data structures which provide worst-case guarantees;
for example, many data structures used in computational geometry can be based on red–black trees, and
the Completely Fair Scheduler used in current Linux kernels uses red–black trees. In the version 8 of Java,
the Collection HashMap has been modified such that instead of using a LinkedList to store identical elements with poor
hashcodes, a Red-Black tree is used.
In practice:
For every 2-4 tree, there are corresponding red–black trees with data elements in the same order. The insertion and deletion
operations on 2-4 trees are also equivalent to color-flipping and rotations in red–black trees. This makes 2-4 trees an
important tool for understanding the logic behind red–black trees, and this is why many introductory algorithm texts introduce
2-4 trees just before red–black trees, even though 2-4 trees are not often used in practice.
fun fact: it's a mystery, but the B could stand for Boeing, Balanced, or Bayer (co-inventor)
In Practice:
B-Trees are widely used in databases. Most modern filesystems use B-trees (or Variants). In addition to
its use in databases, the B-tree is also used in filesystems to allow quick random access to an arbitrary
block in a particular file. The basic problem is turning the file block i address into a disk block
(or perhaps to a cylinder-head-sector) address.
MIT 6.851 - Memory Hierarchy Models (video)
- covers cache-oblivious B-Trees, very interesting data structures
- the first 37 minutes are very technical, may be skipped (B is block size, cache line size)
k-D Trees
great for finding number of points in a rectangle or higher dimension object
I added these to reinforce some ideas already presented above, but didn't want to include them
above because it's just too much. It's easy to overdo it on a subject.
You want to get hired in this century, right?
4e69861
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Coding Interview University
Translations:
Translations in progress:
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.
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 operations 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]
git checkout -b progress
git remote add jwasham https://github.com/jwasham/coding-interview-university
git fetch --all
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 Lynda.com 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. Lynda.com courses are not free.
Interview Process & General Interview Prep
ABC: Always Be Coding
Whiteboarding
Effective Whiteboarding during Programming Interviews
Demystifying Tech Recruiting
Cracking The Coding Interview Set 1:
How to Get a Job at the Big 4:
Prep Course:
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:
You could also use these, but read around first. There may be caveats:
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:
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.
C++
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.
Java
OR:
Python
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)
Introduction to Algorithms
Programming Pearls
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 ShenBefore 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: https://ankiweb.net/shared/info/25173560 (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:
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:
You don't need all these. You need only one language for the interview.
Why code in all of these?
I may not have time to do all of these for every subject, but I'll try.
You can see my code here:
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
Learn C
you'll quickly get proficient. Understanding C helps you understand how programs and memory work.
How computers process a program:
Algorithmic complexity / Big-O / Asymptotic analysis
nothing to implement
Harvard CS50 - Asymptotic Notation (video)
Big O Notations (general quick tutorial) (video)
Big O Notation (and Omega and Theta) - best mathematical explanation (video)
Skiena:
A Gentle Introduction to Algorithm Complexity Analysis
Orders of Growth (video)
Asymptotics (video)
UC Berkeley Big O (video)
UC Berkeley Big Omega (video)
Amortized Analysis (video)
Illustrating "Big O" (video)
TopCoder (includes recurrence relations and master theorem):
Cheat sheet
If some of the lectures are too mathy, you can jump down to the bottom and
watch the discrete mathematics videos to get the background knowledge.
Data Structures
Arrays
Linked Lists
- not the whole video, just portions about Node struct and memory allocation.
(for when you pass a pointer to a function that may change the address where that pointer points)
This page is just to get a grasp on ptr to ptr. I don't recommend this list traversal style. Readability and maintainability suffer due to cleverness.
Stack
Queue
because you'd need the next to last element, causing a full traversal each dequeue
Hash table
Videos:
Online Courses:
implement with array using linear probing
More Knowledge
Binary search
Bitwise operations
Bit Manipulation (video)
Trees
Trees - Notes & Background
time complexity: O(n)
space complexity: best: O(1), worst: O(n/2)=O(n)
time complexity: O(n)
space complexity:
best: O(log n) - avg. height of tree
worst: O(n)
Binary search trees: BSTs
Heap / Priority Queue / Binary Heap
Sorting
Notes:
For heapsort, see Heap data structure above. Heap sort is great, but not stable.
Sedgewick - Mergesort (5 videos)
Sedgewick - Quicksort (4 videos)
UC Berkeley:
Bubble Sort (video)
Analyzing Bubble Sort (video)
Insertion Sort, Merge Sort (video)
Insertion Sort (video)
Merge Sort (video)
Quicksort (video)
Selection Sort (video)
Merge sort code:
Quick sort code:
Implement:
Not required, but I recommended them:
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
Graphs can be used to represent many problems in computer science, so this section is long, like trees and sorting were.
Notes:
Skiena Lectures - great intro:
Graphs (review and more):
CS 61B 2014 (starting at 58:09) (video)Full Coursera Course:
I'll implement:
You'll get more graph practice in Skiena's book (see Books section below) and the interview books
Even More Knowledge
Recursion
Dynamic Programming
Dynamic Programming (video)
Object-Oriented Programming
Design patterns
Combinatorics (n choose k) & Probability
NP, NP-Complete and Approximation Algorithms
and be able to recognize them when an interviewer asks you them in disguise.
Caches
Processes and Threads
Papers
Testing
Scheduling
Implement system routines
String searching & manipulations
If you need more detail on this subject, see "String Matching" section in Additional Detail on Some Subjects
Tries
to track the path.
Floating Point Numbers
Unicode
Endianness
Networking
System Design, Scalability, Data Handling
there is a lot to consider when designing a software/hardware system that can scale.
Expect to spend quite a bit of time on this.
Final Review
Coding Question Practice
Now that you know all the computer science topics above, it's time to practice answering coding problems.
Coding question practice is not about memorizing answers to programming problems.
Why you need to practice doing programming problems:
There is a great intro for methodical, communicative problem solving in an interview. You'll get this from the programming
interview books, too, but I found this outstanding:
Algorithm design canvas
No whiteboard at home? That makes sense. I'm a weirdo and have a big whiteboard. Instead of a whiteboard, pick up a
large drawing pad from an art store. You can sit on the couch and practice. This is my "sofa whiteboard".
I added the pen in the photo for scale. If you use a pen, you'll wish you could erase. Gets messy quick.
Supplemental:
Read and Do Programming Problems (in this order):
See Book List above
Coding exercises/challenges
Once you've learned your brains out, put those brains to work.
Take coding challenges every day, as many as you can.
Coding Interview Question Videos:
Challenge sites:
Challenge repos:
Mock Interviews:
Once you're closer to the interview
Your Resume
Be thinking of for when the interview comes
Think of about 20 interview questions you'll get, along with the lines of the items below. Have 2-3 answers for each.
Have a story, not just data, about something you accomplished.
Have questions for the interviewer
Once You've Got The Job
Congratulations!
Keep learning.
You're never really done.
Additional Books
Additional Learning
These topics will likely not come up in an interview, but I added them to help you become a well-rounded
software engineer, and to be aware of certain technologies and algorithms, so you'll have a bigger toolbox.
Compilers
Emacs and vi(m)
Unix command line tools
Information theory (videos)
Parity & Hamming Code (videos)
Entropy
Cryptography
Compression
Computer Security
Garbage collection
Parallel Programming
Messaging, Serialization, and Queueing Systems
A*
Fast Fourier Transform
Bloom Filter
HyperLogLog
Locality-Sensitive Hashing
van Emde Boas Trees
Augmented Data Structures
Balanced search trees
Know least one type of balanced binary tree (and know how it's implemented):
"Among balanced search trees, AVL and 2/3 trees are now passé, and red-black trees seem to be more popular.
A particularly interesting self-organizing data structure is the splay tree, which uses rotations
to move any accessed key to the root." - Skiena
Of these, I chose to implement a splay tree. From what I've read, you won't implement a
balanced search tree in your interview. But I wanted exposure to coding one up
and let's face it, splay trees are the bee's knees. I did read a lot of red-black tree code.
If you end up implementing red/black tree try just these:
I want to learn more about B-Tree since it's used so widely with very large data sets.
Self-balancing binary search tree
AVL trees
From what I can tell, these aren't used much in practice, but I could see where they would be:
The AVL tree is another structure supporting O(log n) search, insertion, and removal. It is more rigidly
balanced than red–black trees, leading to slower insertion and removal but faster retrieval. This makes it
attractive for data structures that may be built once and loaded without reconstruction, such as language
dictionaries (or program dictionaries, such as the opcodes of an assembler or interpreter).
Splay trees
Splay trees are typically used in the implementation of caches, memory allocators, routers, garbage collectors,
data compression, ropes (replacement of string used for long text strings), in Windows NT (in the virtual memory,
networking and file system code) etc.
Red/black trees
Red–black trees offer worst-case guarantees for insertion time, deletion time, and search time.
Not only does this make them valuable in time-sensitive applications such as real-time applications,
but it makes them valuable building blocks in other data structures which provide worst-case guarantees;
for example, many data structures used in computational geometry can be based on red–black trees, and
the Completely Fair Scheduler used in current Linux kernels uses red–black trees. In the version 8 of Java,
the Collection HashMap has been modified such that instead of using a LinkedList to store identical elements with poor
hashcodes, a Red-Black tree is used.
2-3 search trees
2-3 trees have faster inserts at the expense of slower searches (since height is more compared to AVL trees).
2-3-4 Trees (aka 2-4 trees)
For every 2-4 tree, there are corresponding red–black trees with data elements in the same order. The insertion and deletion
operations on 2-4 trees are also equivalent to color-flipping and rotations in red–black trees. This makes 2-4 trees an
important tool for understanding the logic behind red–black trees, and this is why many introductory algorithm texts introduce
2-4 trees just before red–black trees, even though 2-4 trees are not often used in practice.
N-ary (K-ary, M-ary) trees
B-Trees
B-Trees are widely used in databases. Most modern filesystems use B-trees (or Variants). In addition to
its use in databases, the B-tree is also used in filesystems to allow quick random access to an arbitrary
block in a particular file. The basic problem is turning the file block i address into a disk block
(or perhaps to a cylinder-head-sector) address.
- covers cache-oblivious B-Trees, very interesting data structures
- the first 37 minutes are very technical, may be skipped (B is block size, cache line size)
k-D Trees
Skip lists
Network Flows
Disjoint Sets & Union Find
Math for Fast Processing
Treap
Linear Programming (videos)
Geometry, Convex hull (videos)
Discrete math
Machine Learning
- videos only
- see videos 12-18 for a review of linear algebra (14 and 15 are duplicates)
--
Additional Detail on Some Subjects
Union-Find
More Dynamic Programming (videos)
Advanced Graph Processing (videos)
MIT Probability (mathy, and go slowly, which is good for mathy things) (videos):
Simonson: Approximation Algorithms (video)
String Matching
Sorting
Video Series
Sit back and enjoy. "Netflix and skill" :P
List of individual Dynamic Programming problems (each is short)
x86 Architecture, Assembly, Applications (11 videos)
MIT 18.06 Linear Algebra, Spring 2005 (35 videos)
Excellent - MIT Calculus Revisited: Single Variable Calculus
Computer Science 70, 001 - Spring 2015 - Discrete Mathematics and Probability Theory
Discrete Mathematics by Shai Simonson (19 videos)
Discrete Mathematics Part 1 by Sarada Herke (5 videos)
CSE373 - Analysis of Algorithms (25 videos)
UC Berkeley 61B (Spring 2014): Data Structures (25 videos)
UC Berkeley 61B (Fall 2006): Data Structures (39 videos)
UC Berkeley 61C: Machine Structures (26 videos)
OOSE: Software Dev Using UML and Java (21 videos)
UC Berkeley CS 152: Computer Architecture and Engineering (20 videos)MIT 6.004: Computation Structures (49 videos)
Carnegie Mellon - Computer Architecture Lectures (39 videos)
MIT 6.006: Intro to Algorithms (47 videos)
MIT 6.033: Computer System Engineering (22 videos)
MIT 6.034 Artificial Intelligence, Fall 2010 (30 videos)
MIT 6.042J: Mathematics for Computer Science, Fall 2010 (25 videos)
MIT 6.046: Design and Analysis of Algorithms (34 videos)
MIT 6.050J: Information and Entropy, Spring 2008 (19 videos)
MIT 6.851: Advanced Data Structures (22 videos)
MIT 6.854: Advanced Algorithms, Spring 2016 (24 videos)
Harvard COMPSCI 224: Advanced Algorithms (25 videos)
MIT 6.858 Computer Systems Security, Fall 2014
Stanford: Programming Paradigms (27 videos)
Introduction to Cryptography by Christof Paar
Mining Massive Datasets - Stanford University (94 videos)
Graph Theory by Sarada Herke (67 videos)
Computer Science Courses