Interview University

What is it?

This is my multi-month study plan for practice. I am a software engineer turned Site Reliability Engineer.Though as an SRE I get to work on scalability and system problems, coding parts has reduced a lot. Most of my coding has been in ansible and packer. Which even though applies same principles doesn't feel like proper coding. So I am going to build on original plan. I will add my own resources and pratice repos.

This long list has been etracted and epanded from Google's coaching notes, so these are the things you need to know. There are etra items I added at the bottom that may come up in the interview or be helpful in solving a problem. Many items are from Steve Yegge's "Get that job at Google" and are reflected sometimes word-for-word in Google's coaching notes.

---

Table of Contents

• What is it?
• Why use it?
• How to use it
• Get in a Googley Mood
• Don't feel you aren't smart enough
• About Video Resources
• Interview Process & General Interview Prep
• Prerequisite Knowledge
• The Daily Plan
• Algorithmic compleity / Big-O / Asymptotic analysis
• Data Structures
  • Arrays
  • Linked Lists
  • Stack
  • Queue
  • Hash table
• More Knowledge
  • Endianness
  • Binary search
  • Bitwise operations
• Trees
  • Trees - Notes & Background
  • Binary search trees: BSTs
  • Heap / Priority Queue / Binary Heap
  • Tries
  • Balanced search trees
  • N-ary (K-ary, M-ary) trees
• Sorting
• Graphs
• Even More Knowledge
  • Recursion
  • Dynamic Programming
  • Combinatorics (n choose k) & Probability
  • NP, NP-Complete and Approimation Algorithms
  • Garbage collection
  • Caches
  • Processes and Threads
  • System Design, Scalability, Data Handling
  • About Google
  • Papers
  • Unicode
  • Emacs and vi(m)
  • Uni command line tools
  • Testing
  • Design patterns
  • Scheduling
  • Implement system routines
  • String searching & manipulations
• Final Review
• Books
• Coding eercises/challenges
• Once you're closer to the interview
• Your Resume
• Be thinking of for when the interview comes
• Have questions for the interviewer
• Additional Learnings (not required)
  • Information theory
  • Parity & Hamming Code
  • Entropy
  • Cryptography
  • Compression
  • Networking
  • Computer Security
  • Parallel Programming
  • Messaging, Serialization, and Queueing Systems
  • Fast Fourier Transform
  • Bloom Filter
  • van Emde Boas Trees
  • Augmented Data Structures
  • Skip lists
  • Network Flows
  • Disjoint Sets & Union Find
  • Math for Fast Processing
  • Treap
  • Linear Programming
  • Geometry, Conve hull
  • Discrete math
  • Machine Learning
  • Go
• Additional Detail on Some Subjects
• Video Series
• Once You've Got The Job

---

Why use it?

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 my progress.

I check each task bo at the beginning of a line when I'm done with it. When all sub-items in a block are done, I put [] at the top level, meaning the entire block is done. Sorry you have to remove all my [] markings to use this the same way. If you search/replace, just replace [] with [ ]. Sometimes I just put a [] at top level if I know I've done all the subtasks, to cut down on clutter.

Once I move past the learning phase (in a couple days), I'll remove the checks from all the checkboes.

More about Github flavored markdown: https://guides.github.com/features/mastering-markdown/#GitHub-flavored-markdown

I have a friendly referral already to get my resume in at Google. Thanks JP.

Get in a Googley Mood

Print out a "future Googler" sign (or two) and keep your eyes on the prize.

Don't feel you aren't smart enough

• Google engineers are smart, but many have an insecurity that they aren't smart enough, even though they work at Google.
• The myth of the Genius Programmer: https://www.youtube.com/watch?v=0SARbwvhupQ

About Video Resources

Some videos are available only by enrolling in a Coursera or Ed class. It is free to do so, but sometimes the classes are no longer in session so you have to wait a couple of months, so you have no access. I'm going to be adding more videos from public sources and replacing the online course videos over time. I like using university lectures.

Interview Process & General Interview Prep

• [] Videos:

  • [] https://www.youtube.com/watch?v=oWbUtlUhwa8&feature=youtu.be
  • [] https://www.youtube.com/watch?v=qc1owf2-220&feature=youtu.be
  • [] https://www.youtube.com/watch?v=8npJLkcmu8

• [] Articles:

  • [] http://www.google.com/about/careers/lifeatgoogle/hiringprocess/
  • [] http://steve-yegge.blogspot.com/2008/03/get-that-job-at-google.html
    • all the things he mentions that you need to know are listed below
  • [] (very dated) http://dondodge.typepad.com/the_net_big_thing/2010/09/how-to-get-a-job-at-google-interview-questions-hiring-process.html
  • [] http://sites.google.com/site/steveyegge2/five-essential-phone-screen-questions

• [] Additional (not suggested by Google but I added):

  • [] https://medium.com/always-be-coding/abc-always-be-coding-d5f8051afce2#.4heg8zvm4
  • [] https://medium.com/always-be-coding/four-steps-to-google-without-a-degree-8f381aa6bd5e#.asalo1vf
  • [] https://medium.com/@dpup/whiteboarding-4df873dbba2e#.hf6jn45g1
  • [] http://www.kpcb.com/blog/lessons-learned-how-google-thinks-about-hiring-management-and-culture
  • [] http://www.coderust.com/blog/2014/04/10/effective-whiteboarding-during-programming-interviews/
  • [] Cracking The Coding Interview Set 1:
    • [] https://www.youtube.com/watch?v=rEJzOhC5ZtQ
    • [] https://www.youtube.com/watch?v=aCltDcdpsQ
  • [] How to Get a Job at the Big 4:
    • [] https://www.youtube.com/watch?v=YJZCUhNCv8
  • [] http://alebowe.com/failing-at-google-interviews/

Prerequisite Knowledge

This short section were prerequisites/interesting info I wanted to learn before getting started on the daily plan.

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

• C++
• Java
• Python

You need to be very comfortable in the language, and be knowledgeable. Read more (rescued from the lost web): - https://web.archive.org/web/20160204193730/http://blog.codingforinterviews.com/best-programming-language-jobs/

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

• [] How computers process a program:

  • [] https://www.youtube.com/watch?v=42KTvGYQYnA
  • [] https://www.youtube.com/watch?v=Mv2QgpbTNE

• [] How floating point numbers are stored:

  • [] simple 8-bit: http://math.stackechange.com/questions/301435/fractions-in-binary
  • [] 32 bit: https://www.youtube.com/watch?v=ji3SfClm8TU
  • [] 64 bit: https://www.youtube.com/watch?v=50ZYcZebIec

• [] Computer Arch Intro: (first video only - interesting but not required) https://www.youtube.com/watch?v=zLP_4wyHbY&list=PL5PHm2jkkmi5CI7b3JCL1TWybTDtKq&inde=1

• [] C

  • [] ANSI C Cheat Sheet
  • [] K&R C book (ANSI C)
  • [] Clang: https://www.youtube.com/watch?v=U3zCnj2w8M
  • [] GDB:
    • https://www.youtube.com/watch?v=USPvePv1uzE
    • https://www.youtube.com/watch?v=y5JmQItfFck
    • Valgrind: https://www.youtube.com/watch?v=fvTsFjDuag8

• [] C++

  • [] C++ Cheat Sheet
  • [] STL Cheat Sheet
  • [] basics
  • [] pointers
  • [] functions
  • [] references
  • [] templates
  • [] compilation
  • [] scope & linkage
  • [] namespaces
  • [] OOP
  • [] STL
  • [] functors: http://www.cprogramming.com/tutorial/functors-function-objects-in-c++.html
  • [] C++ at Google: https://www.youtube.com/watch?v=NOCElcMcFik
  • [] Google C++ Style Guide: https://google.github.io/styleguide/cppguide.html
    • [] Google uses clang-format (there is a command line "style" argument: -style=google)
  • [] Efficiency with Algorithms, Performance with Data Structures: https://youtu.be/fHNmRkzHWs
  • [] review of C++ concepts: https://www.youtube.com/watch?v=Rub-JsjMhWY

• [] Python

  • [] Python Cheat Sheet
  • [] Python in One Video: https://www.youtube.com/watch?v=N4mEzFDjqtA
  • [] Series on 3.4: https://www.youtube.com/playlist?list=PL6g4Cwl9DGAcbMi1sH6oAMk4JHw91mC_
  • [] Zero to Hero: https://www.youtube.com/watch?v=emY34tSKc4
  • [] Statistics for Hackers: https://www.youtube.com/watch?v=Iq9DzN6mvYA
  • [] Faster Python: https://www.youtube.com/watch?v=JDSGVvMwNM8
  • [] CPython Walk: https://www.youtube.com/watch?v=LhadeL7_EIU&list=PLzV58Zm8FuBL6OAv1Yu6AwZrnsFbbR0S&inde=6
  • [] 10 Tips for Pythonic Code: https://www.youtube.com/watch?v=_O23jIsshs
  • [] Beyond PEP 8 -- Best practices for beautiful intelligible code: https://www.youtube.com/watch?v=wf-BqAjZb8M

• [] Compilers

  • [] https://class.coursera.org/compilers-004/lecture/1
  • [] https://class.coursera.org/compilers-004/lecture/2
  • [] C++: https://www.youtube.com/watch?v=twodd1KFfGk
  • [] Understanding Compiler Optimization (C++): https://www.youtube.com/watch?v=FnGCDLhaKU

The Daily Plan

Each day I will take a subject from the list. After understanding Gist will move for the implementation. Not all day will be stubject understanding. Other's I will be solving problem from the selected subject. Problem Solving/Implementation

• Whiteboard / Notebook coding
• Code walkthrough using examples
• Actual coding and testing

I will try to follow Test Driven Coding philosophies.

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 (ecept Python)) Make use of built-in types so I have eperience 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:

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

Write code on a whiteboard, not a computer. Test with some sample inputs. Then test it out on a computer to make sure it's not buggy from synta.

Algorithmic compleity / Big-O / Asymptotic analysis

• nothing to implement

• [] Harvard CS50 - Asymptotic Notation: https://www.youtube.com/watch?v=iOq5kSKqeR4

• [] Big O Notations (general quick tutorial) - https://www.youtube.com/watch?v=V6mKVRU1evU

• [] Big O Notation (and Omega and Theta) - best mathematical eplanation:

  • https://www.youtube.com/watch?v=ei-A_wy5Yw&inde=2&list=PL1BaGV1cIH4UhkL8a9bJGG356covJ76qN

• [] Skiena:

  • video: https://www.youtube.com/watch?v=gSyDMtdPNpU&inde=2&list=PLOtl7M3yp-DV69F32zdK7YJcNpTunF2b
  • slides: http://www3.cs.stonybrook.edu/~algorith/video-lectures/2007/lecture2.pdf

• [] A Gentle Introduction to Algorithm Compleity Analysis: http://discrete.gr/compleity/

• [] Orders of Growth: https://class.coursera.org/algorithmicthink1-004/lecture/59

• [] Asymptotics: https://class.coursera.org/algorithmicthink1-004/lecture/61

• [] UC Berkeley Big O: https://youtu.be/VIS4YDpuP98

• [] UC Berkeley Big Omega: https://youtu.be/ca3e7UVmeUc

• [] Amortized Analysis: https://www.youtube.com/watch?v=B3SpQZaAZP4&inde=10&list=PL1BaGV1cIH4UhkL8a9bJGG356covJ76qN

• [] Illustrating "Big O": https://class.coursera.org/algorithmicthink1-004/lecture/63

• [] TopCoder (includes recurrence relations and master theorem):

  • Computational Compleity: Section 1: https://www.topcoder.com/community/data-science/data-science-tutorials/computational-compleity-section-1/
  • Computational Compleity: Section 2: https://www.topcoder.com/community/data-science/data-science-tutorials/computational-compleity-section-2/

• [] Cheat sheet: http://bigocheatsheet.com/

  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

  • Implement an automatically resizing vector.
  • [] Description:
    • Arrays: https://www.coursera.org/learn/data-structures/lecture/OsBSF/arrays
    • Arrays: https://www.lynda.com/Developer-Programming-Foundations-tutorials/Basic-arrays/149042/177104-4.html
    • Multi-dim: https://www.lynda.com/Developer-Programming-Foundations-tutorials/Multidimensional-arrays/149042/177105-4.html
    • Dynamic Arrays: https://www.coursera.org/learn/data-structures/lecture/EwbnV/dynamic-arrays
    • Jagged: https://www.lynda.com/Developer-Programming-Foundations-tutorials/Jagged-arrays/149042/177106-4.html
    • Resizing arrays:
      • https://www.lynda.com/Developer-Programming-Foundations-tutorials/Resizable-arrays/149042/177108-4.html
  • [] Implement a vector (mutable array with automatic resizing):
    • [] Practice coding using arrays and pointers, and pointer math to jump to an inde instead of using indeing.
    • [] new raw data array with allocated memory
      • can allocate int array under the hood, just not use its features
      • start with 16, or if starting number is greater, use power of 2 - 16, 32, 64, 128
    • [] size() - number of items
    • [] capacity() - number of items it can hold
    • [] is_empty()
    • [] at(inde) - returns item at given inde, blows up if inde out of bounds
    • [] push(item)
    • [] insert(inde, item) - inserts item at inde, shifts that inde's value and trailing elements to the right
    • [] prepend(item) - can use insert above at inde 0
    • [] pop() - remove from end, return value
    • [] delete(inde) - delete item at inde, shifting all trailing elements left
    • [] remove(item) - looks for value and removes inde holding it (even if in multiple places)
    • [] find(item) - looks for value and returns first inde with that value, -1 if not found
    • [] resize(new_capacity) // private function
      • when you reach capacity, resize to double the size
      • when popping an item, if size is 1/4 of capacity, resize to half
  • [] Time
    • O(1) to add/remove at end (amortized for allocations for more space), inde, or update
    • O(n) to insert/remove elsewhere
  • [] Space
    • contiguous in memory, so proimity helps performance
    • space needed = (array capacity, which is >= n) * size of item, but even if 2n, still O(n)

• Linked Lists

  • [] Description:
    • [] https://www.coursera.org/learn/data-structures/lecture/kHhgK/singly-linked-lists
    • [] CS 61B - Linked lists: https://www.youtube.com/watch?v=sJtJOtCW_M&list=PL-v-cvA_iAlnI-BQr9hjqADPBtujFJd&inde=5
  • [] C Code: https://www.youtube.com/watch?v=QN6FPiD0Gzo - not the whole video, just portions about Node struct and memory allocation.
  • [] Linked List vs Arrays:
    • https://www.coursera.org/learn/data-structures-optimizing-performance/lecture/rjBs9/core-linked-lists-vs-arrays
    • https://www.coursera.org/learn/data-structures-optimizing-performance/lecture/QUaUd/in-the-real-world-lists-vs-arrays
  • [] why you should avoid linked lists:
    • https://www.youtube.com/watch?v=YQs6IC-vgmo
  • [] 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.
    • https://www.eskimo.com/~scs/cclass/int/s8.html
  • [] implement (I did with tail pointer & without):
    • [] size() - returns number of data elements in list
    • [] empty() - bool returns true if empty
    • [] value_at(inde) - returns the value of the nth item (starting at 0 for first)
    • [] push_front(value) - adds an item to the front of the list
    • [] pop_front() - remove front item and return its value
    • [] push_back(value) - adds an item at the end
    • [] pop_back() - removes end item and returns its value
    • [] front() - get value of front item
    • [] back() - get value of end item
    • [] insert(inde, value) - insert value at inde, so current item at that inde is pointed to by new item at inde
    • [] erase(inde) - removes node at given inde
    • [] value_n_from_end(n) - returns the value of the node at nth position from the end of the list
    • [] reverse() - reverses the list
    • [] remove_value(value) - removes the first item in the list with this value
  • [] Doubly-linked List
    • Description: https://www.coursera.org/learn/data-structures/lecture/jpGKD/doubly-linked-lists
    • No need to implement

• Stack

  • [] https://www.coursera.org/learn/data-structures/lecture/UdKzQ/stacks
  • [] https://www.lynda.com/Developer-Programming-Foundations-tutorials/Using-stacks-last-first-out/149042/177120-4.html
  • [] Will not implement. Implementing with array is trivial.

• Queue

  • [] https://www.lynda.com/Developer-Programming-Foundations-tutorials/Using-queues-first-first-out/149042/177122-4.html
  • [] https://www.coursera.org/learn/data-structures/lecture/EShpq/queue
  • [] Circular buffer/FIFO: https://en.wikipedia.org/wiki/Circular_buffer
  • [] https://www.lynda.com/Developer-Programming-Foundations-tutorials/Priority-queues-deques/149042/177123-4.html
  • [] Implement using linked-list, with tail pointer:
    • enqueue(value) - adds value at position at tail
    • dequeue() - returns value and removes least recently added element (front)
    • empty()
  • [] Implement using fied-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 net to last element, causing a full traversal each dequeue
    • enqueue: O(1) (amortized, linked list and array [probing])
    • dequeue: O(1) (linked list and array)
    • empty: O(1) (linked list and array)

• Hash table

  • [] Videos:

    • [] Hashing with Chaining: https://www.youtube.com/watch?v=0M_kIqhwbFo&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb&inde=8
    • [] Table Doubling, Karp-Rabin: https://www.youtube.com/watch?v=BRO7mVIFt08&inde=9&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb
    • [] Open Addressing, Cryptographic Hashing: https://www.youtube.com/watch?v=rvdJDijO2Ro&inde=10&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb
    • [] PyCon 2010: The Mighty Dictionary: https://www.youtube.com/watch?v=C4Kc8zcA68
    • [] (Advanced) Randomization: Universal & Perfect Hashing: https://www.youtube.com/watch?v=z0lJ2k0sl1g&list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp&inde=11
    • [] (Advanced) Perfect hashing: https://www.youtube.com/watch?v=N0COwN14gt0&list=PL2B4EEwhKD-NbwZ4ezj7gyc_3yNrojKM9&inde=4

  • [] Online Courses:

    • [] https://www.lynda.com/Developer-Programming-Foundations-tutorials/Understanding-hash-functions/149042/177126-4.html
    • [] https://www.lynda.com/Developer-Programming-Foundations-tutorials/Using-hash-tables/149042/177127-4.html
    • [] https://www.lynda.com/Developer-Programming-Foundations-tutorials/Supporting-hashing/149042/177128-4.html
    • [] https://www.lynda.com/Developer-Programming-Foundations-tutorials/Language-support-hash-tables/149042/177129-4.html
    • [] https://www.coursera.org/learn/data-structures-optimizing-performance/lecture/m7UuP/core-hash-tables
    • [] https://www.coursera.org/learn/data-structures/home/week/3
    • [] https://www.coursera.org/learn/data-structures/lecture/NYZZP/phone-book-problem
    • [] distributed hash tables:
      • https://www.coursera.org/learn/data-structures/lecture/DvaIb/instant-uploads-and-storage-optimization-in-dropbo
      • https://www.coursera.org/learn/data-structures/lecture/tvH8H/distributed-hash-tables

  • [] implement with array using linear probing

    • hash(k, m) - m is size of hash table
    • add(key, value) - if key already eists, update value
    • eists(key)
    • get(key)
    • remove(key)

More Knowledge

• Endianness

  • [] https://www.cs.umd.edu/class/sum2003/cmsc311/Notes/Data/endian.html
  • [] https://www.youtube.com/watch?v=JrNF0KRAlyo
  • [] https://www.youtube.com/watch?v=oBSuP-1Tc0
    • Very technical talk for kernel devs. Don't worry if most is over your head.
    • The first half is enough.

• Binary search

  • [] https://www.youtube.com/watch?v=D5SrAga1pno
  • [] https://www.khanacademy.org/computing/computer-science/algorithms/binary-search/a/binary-search
  • [] detail: https://www.topcoder.com/community/data-science/data-science-tutorials/binary-search/
  • [] Implement:
    • binary search (on sorted array of integers)
    • binary search using recursion

• Bitwise operations

  • [] Bits cheat sheet - you should know many of the powers of 2 from (2^1 to 2^16 and 2^32)
  • [] Get a really good understanding of manipulating bits with: &, |, ^, ~, >>, <<
    • [] words: https://en.wikipedia.org/wiki/Word_(computer_architecture)
    • [] Good intro: https://www.youtube.com/watch?v=7jkIUgLC29I
    • [] https://www.youtube.com/watch?v=d0AwjSpNR0
    • [] https://en.wikipedia.org/wiki/Bit_manipulation
    • [] https://en.wikipedia.org/wiki/Bitwise_operation
    • [] https://graphics.stanford.edu/~seander/bithacks.html
    • [] http://bits.stephan-brumme.com/
    • [] http://bits.stephan-brumme.com/interactive.html
  • [] 2s and 1s complement
    • https://www.youtube.com/watch?v=lKTsv6iVV4
    • https://en.wikipedia.org/wiki/Ones%27_complement
    • https://en.wikipedia.org/wiki/Two%27s_complement
  • [] count set bits
    • https://youtu.be/Hzuzo9NJrlc
    • https://graphics.stanford.edu/~seander/bithacks.html#CountBitsSetKernighan
    • http://stackoverflow.com/questions/109023/how-to-count-the-number-of-set-bits-in-a-32-bit-integer
  • [] round to net power of 2:
    • http://bits.stephan-brumme.com/roundUpToNetPowerOfTwo.html
  • [] swap values:
    • http://bits.stephan-brumme.com/swap.html
  • [] absolute value:
    • http://bits.stephan-brumme.com/absInteger.html

Trees

• Trees - Notes & Background

  • [] Series: https://www.coursera.org/learn/data-structures-optimizing-performance/lecture/ovovP/core-trees
  • [] Series: https://www.coursera.org/learn/data-structures/lecture/95qda/trees
  • basic tree construction
  • traversal
  • manipulation algorithms
  • BFS (breadth-first search)
    • MIT: https://www.youtube.com/watch?v=s-CYnVz-uh4&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb&inde=13
    • level order (BFS, using queue) time compleity: O(n) space compleity: best: O(1), worst: O(n/2)=O(n)
  • DFS (depth-first search)
    • MIT: https://www.youtube.com/watch?v=AfSk24UTFS8&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb&inde=14
    • notes: time compleity: O(n) space compleity: best: O(log n) - avg. height of tree worst: O(n)
    • inorder (DFS: left, self, right)
    • postorder (DFS: left, right, self)
    • preorder (DFS: self, left, right)

• Binary search trees: BSTs

  • [] Binary Search Tree Review: https://www.youtube.com/watch?v=6At0nz92o&inde=1&list=PLA5Lqm4uh9Bbq-E0ZnqTIa8LRaL77ica6
  • [] Series: https://www.coursera.org/learn/data-structures-optimizing-performance/lecture/p82sw/core-introduction-to-binary-search-trees
    • starts with symbol table and goes through BST applications
  • [] https://www.coursera.org/learn/data-structures/lecture/E7cP/introduction
  • [] MIT: https://www.youtube.com/watch?v=9Jry5-82I68
  • C/C++:
    • [] https://www.youtube.com/watch?v=COZK7NATh4k&list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P&inde=28
    • [] https://www.youtube.com/watch?v=hWokyBoo0aI&list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P&inde=29
    • [] https://www.youtube.com/watch?v=Ut90klNN264&inde=30&list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P
    • [] https://www.youtube.com/watch?v=_pnqMz5nrRs&list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P&inde=31
    • [] https://www.youtube.com/watch?v=9RHO6jU--GU&list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P&inde=32
    • [] https://www.youtube.com/watch?v=86g8jAQug04&inde=33&list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P
    • [] https://www.youtube.com/watch?v=gm8DUJJhmY4&inde=34&list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P
    • [] https://www.youtube.com/watch?v=yEwSGhSsT0U&inde=35&list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P
    • [] https://www.youtube.com/watch?v=gcULE7ViZw&list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P&inde=36
    • [] https://www.youtube.com/watch?v=5cPbNCrdotA&inde=37&list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P
  • [] Implement:
    • [] insert // insert value into tree
    • [] get_node_count // get count of values stored
    • [] print_values // prints the values in the tree, from min to ma
    • [] delete_tree
    • [] is_in_tree // returns true if given value eists in the tree
    • [] get_height // returns the height in nodes (single node's height is 1)
    • [] get_min // returns the minimum value stored in the tree
    • [] get_ma // returns the maimum value stored in the tree
    • [] is_binary_search_tree
    • [] delete_value
    • [] get_successor // returns net-highest value in tree after given value, -1 if none

• Heap / Priority Queue / Binary Heap

  • visualized as a tree, but is usually linear in storage (array, linked list)
  • [] https://en.wikipedia.org/wiki/Heap_(data_structure)
  • [] https://www.coursera.org/learn/data-structures/lecture/2OpTs/introduction
  • [] https://www.coursera.org/learn/data-structures/lecture/z3l9N/naive-implementations
  • [] https://www.coursera.org/learn/data-structures/lecture/GRV2q/binary-trees
  • [] https://www.coursera.org/learn/data-structures/supplement/S5z/tree-height-remark
  • [] https://www.coursera.org/learn/data-structures/lecture/GRV2q/binary-trees
  • [] https://www.coursera.org/learn/data-structures/lecture/0g1dl/basic-operations
  • [] https://www.coursera.org/learn/data-structures/lecture/gl5Ni/complete-binary-trees
  • [] https://www.coursera.org/learn/data-structures/lecture/HQo9/pseudocode
  • [] Heap Sort - jumps to start: https://youtu.be/odNJmw5TOEE?list=PLFDnELG9dpVQCuD-9BSy2E7BWY3t5Sm&t=3291
  • [] Heap Sort: https://www.coursera.org/learn/data-structures/lecture/hSzMO/heap-sort
  • [] Building a heap: https://www.coursera.org/learn/data-structures/lecture/dwrOS/building-a-heap
  • [] MIT: Heaps and Heap Sort: https://www.youtube.com/watch?v=B7hVCmfPtM&inde=4&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb
  • [] CS 61B Lecture 24: Priority Queues: https://www.youtube.com/watch?v=yIUFT6AKBGE&inde=24&list=PL4BBB74C7D2A1049C
  • [] Linear Time BuildHeap (ma-heap): https://www.youtube.com/watch?v=MiyLo8adrWw
  • [] Implement a ma-heap:
    • [] insert
    • [] sift_up - needed for insert
    • [] get_ma - returns the ma item, without removing it
    • [] get_size() - return number of elements stored
    • [] is_empty() - returns true if heap contains no elements
    • [] etract_ma - returns the ma item, removing it
    • [] sift_down - needed for etract_ma
    • [] remove(i) - removes item at inde
    • [] heapify - create a heap from an array of elements, needed for heap_sort
    • [] heap_sort() - take an unsorted array and turn it into a sorted array in-place using a ma heap
      • note: using a min heap instead would save operations, but double the space needed (cannot do in-place).

• Tries

  • Note there are different kinds of tries. Some have prefies, some don't, and some use string instead of bits to track the path.
  • I read through code, but will not implement.
  • [] http://www.cs.yale.edu/homes/aspnes/classes/223/notes.html#Tries
  • [] Short course videos:
    • [] https://www.coursera.org/learn/data-structures-optimizing-performance/lecture/08yf/core-introduction-to-tries
    • [] https://www.coursera.org/learn/data-structures-optimizing-performance/lecture/PvlZW/core-performance-of-tries
    • [] https://www.coursera.org/learn/data-structures-optimizing-performance/lecture/DFvd3/core-implementing-a-trie
  • [] The Trie: A Neglected Data Structure: https://www.toptal.com/java/the-trie-a-neglected-data-structure
  • [] TopCoder - Using Tries: https://www.topcoder.com/community/data-science/data-science-tutorials/using-tries/
  • [] Stanford Lecture (real world use case): https://www.youtube.com/watch?v=TJ8SkcUSdbU
  • [] MIT, Advanced Data Structures, Strings (can get pretty obscure about halfway through): https://www.youtube.com/watch?v=NinWEPPrkDQ&inde=16&list=PLUl4u3cNGP61hsJNdULdudlRL493b-Zf

• 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 eposure 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.

  • [] Self-balancing binary search tree: https://en.wikipedia.org/wiki/Self-balancing_binary_search_tree

  • [] AVL trees

    • 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).
    • [] MIT AVL Trees / AVL Sort: https://www.youtube.com/watch?v=FNeL18KsWPc&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb&inde=6
    • [] https://www.coursera.org/learn/data-structures/lecture/Qq5E0/avl-trees
    • [] https://www.coursera.org/learn/data-structures/lecture/PKEBC/avl-tree-implementation
    • [] https://www.coursera.org/learn/data-structures/lecture/22BgE/split-and-merge

  • [] Splay trees

    • 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 tet strings), in Windows NT (in the virtual memory, networking, and file system code) etc.
    • [] CS 61B: Splay Trees: https://www.youtube.com/watch?v=Najzh1rYQTo&inde=23&list=PL-v-cvA_iAlnI-BQr9hjqADPBtujFJd
    • [] MIT Lecture: Splay Trees: - Gets very mathy, but watch the last 10 minutes for sure. - https://www.youtube.com/watch?v=QnPl_Y6EqMo

  • [] 2-3 search trees

    • In practice: 2-3 trees have faster inserts at the epense of slower searches (since height is more compared to AVL trees).
    • You would use 2-3 tree very rarely because its implementation involves different types of nodes. Instead, people use Red Black trees.
    • [] 23-Tree Intuition and Definition: https://www.youtube.com/watch?v=C3SsdUqasD4&list=PLA5Lqm4uh9Bbq-E0ZnqTIa8LRaL77ica6&inde=2
    • [] Binary View of 23-Tree: https://www.youtube.com/watch?v=iYvBtGKsqSg&inde=3&list=PLA5Lqm4uh9Bbq-E0ZnqTIa8LRaL77ica6
    • [] 2-3 Trees (student recitation): https://www.youtube.com/watch?v=TOb1tuEZ24&inde=5&list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp

  • [] 2-3-4 Trees (aka 2-4 trees)

    • 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 tets introduce 2-4 trees just before red–black trees, even though 2-4 trees are not often used in practice.
    • [] CS 61B Lecture 26: Balanced Search Trees: https://www.youtube.com/watch?v=zqrqYkth6Q&inde=26&list=PL4BBB74C7D2A1049C
    • [] Bottom Up 234-Trees: https://www.youtube.com/watch?v=DQdMYevEyE4&inde=4&list=PLA5Lqm4uh9Bbq-E0ZnqTIa8LRaL77ica6
    • [] Top Down 234-Trees: https://www.youtube.com/watch?v=2679VQ26Fp4&list=PLA5Lqm4uh9Bbq-E0ZnqTIa8LRaL77ica6&inde=5

  • [] B-Trees

    • 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.
    • [] B-Tree: https://en.wikipedia.org/wiki/B-tree
    • [] Introduction to B-Trees: https://www.youtube.com/watch?v=I22wEC1tTGo&list=PLA5Lqm4uh9Bbq-E0ZnqTIa8LRaL77ica6&inde=6
    • [] B-Tree Definition and Insertion: https://www.youtube.com/watch?v=s3bCdZGrgpA&inde=7&list=PLA5Lqm4uh9Bbq-E0ZnqTIa8LRaL77ica6
    • [] B-Tree Deletion: https://www.youtube.com/watch?v=svfnVhJOfMc&inde=8&list=PLA5Lqm4uh9Bbq-E0ZnqTIa8LRaL77ica6
    • [] MIT 6.851 - Memory Hierarchy Models: https://www.youtube.com/watch?v=V3omVLzI0WE&inde=7&list=PLUl4u3cNGP61hsJNdULdudlRL493b-Zf - 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)

  • [] Red/black trees

    • 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 eample, many data structures used in computational geometry can be based on red–black trees, and the Completely Fair Scheduler used in current Linu 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.
    • [] Aduni - Algorithms - Lecture 4 link jumps to starting point: https://youtu.be/1W30f_RmUo?list=PLFDnELG9dpVQCuD-9BSy2E7BWY3t5Sm&t=3871
    • [] Aduni - Algorithms - Lecture 5: https://www.youtube.com/watch?v=hm2GHwyKF1o&list=PLFDnELG9dpVQCuD-9BSy2E7BWY3t5Sm&inde=5
    • [] https://en.wikipedia.org/wiki/Red%E2%80%93black_tree
    • [] https://www.topcoder.com/community/data-science/data-science-tutorials/an-introduction-to-binary-search-and-red-black-trees/

• N-ary (K-ary, M-ary) trees

  • note: the N or K is the branching factor (ma branches)
    • binary trees are a 2-ary tree, with branching factor = 2
    • 2-3 trees are 3-ary
  • [] https://en.wikipedia.org/wiki/K-ary_tree

Sorting

• [] Notes:

  • Implement sorts & know best case/worst case, average compleity of each:
    • no bubble sort - it's terrible - O(n^2), ecept when n <= 16
  • [] stability in sorting algorithms ("Is Quicksort stable?")
    • https://en.wikipedia.org/wiki/Sorting_algorithm#Stability
    • http://stackoverflow.com/questions/1517793/stability-in-sorting-algorithms
    • http://www.geeksforgeeks.org/stability-in-sorting-algorithms/
    • http://homepages.math.uic.edu/~leon/cs-mcs401-s08/handouts/stability.pdf
  • [] Which algorithms can be used on linked lists? Which on arrays? Which on both?
    • I wouldn't recommend sorting a linked list, but merge sort is doable.
    • http://www.geeksforgeeks.org/merge-sort-for-linked-list/

• For heapsort, see Heap data structure above. Heap sort is great, but not stable.

• [] Bubble Sort: https://www.youtube.com/watch?v=P00JgWzz2c&inde=1&list=PL89B61F78B552C1AB

• [] Analyzing Bubble Sort: https://www.youtube.com/watch?v=ni_zk257Nqo&inde=7&list=PL89B61F78B552C1AB

• [] Insertion Sort, Merge Sort: https://www.youtube.com/watch?v=Kg4bqzAqRBM&inde=3&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb

• [] Insertion Sort: https://www.youtube.com/watch?v=c4BRHC7kTaQ&inde=2&list=PL89B61F78B552C1AB

• [] Merge Sort: https://www.youtube.com/watch?v=GCae1WNvnZM&inde=3&list=PL89B61F78B552C1AB

• [] Quicksort: https://www.youtube.com/watch?v=y_G9BkAm6B8&inde=4&list=PL89B61F78B552C1AB

• [] Selection Sort: https://www.youtube.com/watch?v=6nDMgr0-Yyo&inde=8&list=PL89B61F78B552C1AB

• [] Stanford lectures on sorting:

  • [] https://www.youtube.com/watch?v=ENp00ylP7c&inde=15&list=PLFE6E58F856038C69
  • [] https://www.youtube.com/watch?v=y4M9IVgrVKo&inde=16&list=PLFE6E58F856038C69

• [] Shai Simonson, Aduni.org:

  • [] https://www.youtube.com/watch?v=odNJmw5TOEE&list=PLFDnELG9dpVQCuD-9BSy2E7BWY3t5Sm&inde=2
  • [] https://www.youtube.com/watch?v=hj8YKFTFKEE&list=PLFDnELG9dpVQCuD-9BSy2E7BWY3t5Sm&inde=3

• [] Steven Skiena lectures on sorting:

  • [] lecture begins at 26:46: https://youtu.be/ute-pmMkyuk?list=PLOtl7M3yp-DV69F32zdK7YJcNpTunF2b&t=1600
  • [] lecture begins at 27:40: https://www.youtube.com/watch?v=yLvp-pB8mak&inde=8&list=PLOtl7M3yp-DV69F32zdK7YJcNpTunF2b
  • [] lecture begins at 35:00: https://www.youtube.com/watch?v=q7K9otnzlfE&inde=9&list=PLOtl7M3yp-DV69F32zdK7YJcNpTunF2b
  • [] lecture begins at 23:50: https://www.youtube.com/watch?v=TvqIGu9Iupw&list=PLOtl7M3yp-DV69F32zdK7YJcNpTunF2b&inde=10

• [] UC Berkeley:

  • [] CS 61B Lecture 29: Sorting I: https://www.youtube.com/watch?v=EiUvYS2DT6I&list=PL4BBB74C7D2A1049C&inde=29
  • [] CS 61B Lecture 30: Sorting II: https://www.youtube.com/watch?v=2hTY3t80Qsk&list=PL4BBB74C7D2A1049C&inde=30
  • [] CS 61B Lecture 32: Sorting III: https://www.youtube.com/watch?v=Y6LOLpg6Dc&inde=32&list=PL4BBB74C7D2A1049C
  • [] CS 61B Lecture 33: Sorting V: https://www.youtube.com/watch?v=qNMQ4ly43p4&inde=33&list=PL4BBB74C7D2A1049C

• [] - Merge sort code:

  • [] Using output array: http://www.cs.yale.edu/homes/aspnes/classes/223/eamples/sorting/mergesort.c
  • [] In-place: https://github.com/jwasham/practice-cpp/blob/master/merge_sort/merge_sort.cc

• [] - Quick sort code:

  • [] http://www.cs.yale.edu/homes/aspnes/classes/223/eamples/randomization/quick.c
  • [] https://github.com/jwasham/practice-c/blob/master/quick_sort/quick_sort.c

• [] Implement:

  • [] Mergesort: O(n log n) average and worst case
  • [] Quicksort O(n log n) average case
  • Selection sort and insertion sort are both O(n^2) average and worst case
  • For heapsort, see Heap data structure above.

• [] For curiosity - not required:

  • [] Radi Sort: http://www.cs.yale.edu/homes/aspnes/classes/223/notes.html#radiSort
  • [] Radi Sort: https://www.youtube.com/watch?v=hr26ia4k38
  • [] Radi Sort, Counting Sort (linear time given constraints): https://www.youtube.com/watch?v=Nz1KZbghj8&inde=7&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb
  • [] Randomization: Matri Multiply, Quicksort, Freivalds' algorithm: https://www.youtube.com/watch?v=cNB2lADK3_s&inde=8&list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp
  • [] Sorting in Linear Time: https://www.youtube.com/watch?v=pOKy3RZbSws&list=PLUl4u3cNGP61hsJNdULdudlRL493b-Zf&inde=14

Graphs

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

• Notes from Yegge:

  • There are three basic ways to represent a graph in memory:
    • objects and pointers
    • matri
    • adjacency list
  • Familiarize yourself with each representation and its pros & cons
  • BFS and DFS - know their computational compleity, their tradeoffs, and how to implement them in real code
  • When asked a question, look for a graph-based solution first, then move on if none.

• [] Skiena Lectures - great intro:

  • [] CSE373 2012 - Lecture 11 - Graph Data Structures: https://www.youtube.com/watch?v=OihDrFruw&list=PLOtl7M3yp-DV69F32zdK7YJcNpTunF2b&inde=11
  • [] CSE373 2012 - Lecture 12 - Breadth-First Search: https://www.youtube.com/watch?v=g5vF8jscteo&list=PLOtl7M3yp-DV69F32zdK7YJcNpTunF2b&inde=12
  • [] CSE373 2012 - Lecture 13 - Graph Algorithms: https://www.youtube.com/watch?v=S23W6eTcqdY&list=PLOtl7M3yp-DV69F32zdK7YJcNpTunF2b&inde=13
  • [] CSE373 2012 - Lecture 14 - Graph Algorithms (con't): https://www.youtube.com/watch?v=WitPBKGV0HY&inde=14&list=PLOtl7M3yp-DV69F32zdK7YJcNpTunF2b
  • [] CSE373 2012 - Lecture 15 - Graph Algorithms (con't 2): https://www.youtube.com/watch?v=ia1L30l7OIg&inde=15&list=PLOtl7M3yp-DV69F32zdK7YJcNpTunF2b
  • [] CSE373 2012 - Lecture 16 - Graph Algorithms (con't 3): https://www.youtube.com/watch?v=jgDOQq6iWy8&inde=16&list=PLOtl7M3yp-DV69F32zdK7YJcNpTunF2b

• [] Graphs (review and more):

  • [] 6.006 Single-Source Shortest Paths Problem: https://www.youtube.com/watch?v=Aa2sqUhIn-E&inde=15&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb
  • [] 6.006 Dijkstra: https://www.youtube.com/watch?v=2E7MmKv0Y24&inde=16&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb
  • [] 6.006 Bellman-Ford: https://www.youtube.com/watch?v=ozsuci5pIso&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb&inde=17
  • [] 6.006 Speeding Up Dijkstra: https://www.youtube.com/watch?v=CHvQ3q_gJ7E&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb&inde=18
  • [] Aduni: Graph Algorithms I - Topological Sorting, Minimum Spanning Trees, Prim's Algorithm - Lecture 6: https://www.youtube.com/watch?v=i_AQT_fvD8&inde=6&list=PLFDnELG9dpVQCuD-9BSy2E7BWY3t5Sm
  • [] Aduni: Graph Algorithms II - DFS, BFS, Kruskal's Algorithm, Union Find Data Structure - Lecture 7: https://www.youtube.com/watch?v=ufj5_bppBsA&list=PLFDnELG9dpVQCuD-9BSy2E7BWY3t5Sm&inde=7
  • [] Aduni: Graph Algorithms III: Shortest Path - Lecture 8: https://www.youtube.com/watch?v=DiedsPsMKc&list=PLFDnELG9dpVQCuD-9BSy2E7BWY3t5Sm&inde=8
  • [] Aduni: Graph Alg. IV: Intro to geometric algorithms - Lecture 9: https://www.youtube.com/watch?v=IAQRlNkJAw&list=PLFDnELG9dpVQCuD-9BSy2E7BWY3t5Sm&inde=9
  • [] CS 61B 2014 (starting at 58:09): https://youtu.be/dgj4HdMI-Q?list=PL-v-cvA_iAlnI-BQr9hjqADPBtujFJd&t=3489
  • [] CS 61B 2014: Weighted graphs: https://www.youtube.com/watch?v=aJjlQCFwylA&list=PL-v-cvA_iAlnI-BQr9hjqADPBtujFJd&inde=19
  • [] Greedy Algorithms: Minimum Spanning Tree: https://www.youtube.com/watch?v=tKwnms5iRBU&inde=16&list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp
  • [] Strongly Connected Components Kosaraju's Algorithm Graph Algorithm: https://www.youtube.com/watch?v=RpgcYiky7uw

• Full Coursera Course:

  • [] Algorithms on Graphs: https://www.coursera.org/learn/algorithms-on-graphs/home/welcome

• Yegge: If you get a chance, try to study up on fancier algorithms:

  • [] Dijkstra's algorithm - see above - 6.006
  • [] A*
    • [] https://en.wikipedia.org/wiki/A*_search_algorithm
    • [] A* Pathfinding Tutorial: https://www.youtube.com/watch?v=KNfSO4eEE
    • [] A* Pathfinding (E01: algorithm eplanation): https://www.youtube.com/watch?v=-L-WgKMFuhE

• I'll implement:

  • [] DFS with adjacency list (recursive)
  • [] DFS with adjacency list (iterative with stack)
  • [] DFS with adjacency matri (recursive)
  • [] DFS with adjacency matri (iterative with stack)
  • [] BFS with adjacency list
  • [] BFS with adjacency matri
  • [] single-source shortest path (Dijkstra)
  • [] minimum spanning tree
  • DFS-based algorithms (see Aduni videos above):
    • [] check for cycle (needed for topological sort, since we'll check for cycle before starting)
    • [] topological sort
    • [] count connected components in a graph
    • [] list strongly connected components
    • [] check for bipartite graph

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

Even More Knowledge

• Recursion

  • [] Stanford lectures on recursion & backtracking:
    • [] https://www.youtube.com/watch?v=gl3emqCuueQ&list=PLFE6E58F856038C69&inde=8
    • [] https://www.youtube.com/watch?v=uFJhEPrbycQ&list=PLFE6E58F856038C69&inde=9
    • [] https://www.youtube.com/watch?v=NdF1QDTRkck&inde=10&list=PLFE6E58F856038C69
    • [] https://www.youtube.com/watch?v=p-gpaIGRCQI&list=PLFE6E58F856038C69&inde=11
  • when it is appropriate to use it
  • how is tail recursion better than not?
    • [] https://www.quora.com/What-is-tail-recursion-Why-is-it-so-bad
    • [] https://www.youtube.com/watch?v=L1jjGfozc

• Dynamic Programming

  • This subject can be pretty difficult, as each DP soluble problem must be defined as a recursion relation, and coming up with it can be tricky.
  • I suggest looking at many eamples of DP problems until you have a solid understanding of the pattern involved.
  • [] Videos:
    • the Skiena videos can be hard to follow since he sometimes uses the whiteboard, which is too small to see
    • [] Skiena: CSE373 2012 - Lecture 19 - Introduction to Dynamic Programming: https://youtu.be/Qc2ieRgR0k?list=PLOtl7M3yp-DV69F32zdK7YJcNpTunF2b&t=1718
    • [] Skiena: CSE373 2012 - Lecture 20 - Edit Distance: https://youtu.be/IsmMhMdyeGY?list=PLOtl7M3yp-DV69F32zdK7YJcNpTunF2b&t=2749
    • [] Skiena: CSE373 2012 - Lecture 21 - Dynamic Programming Eamples: https://youtu.be/o0V9eYF4UI8?list=PLOtl7M3yp-DV69F32zdK7YJcNpTunF2b&t=406
    • [] Skiena: CSE373 2012 - Lecture 22 - Applications of Dynamic Programming: https://www.youtube.com/watch?v=dRbMC1Ltl3A&list=PLOtl7M3yp-DV69F32zdK7YJcNpTunF2b&inde=22
    • [] Simonson: Dynamic Programming 0 (starts at 59:18): https://youtu.be/J5aJEcOr6Eo?list=PLFDnELG9dpVQCuD-9BSy2E7BWY3t5Sm&t=3558
    • [] Simonson: Dynamic Programming I - Lecture 11: https://www.youtube.com/watch?v=0EzHjQ_SOeU&inde=11&list=PLFDnELG9dpVQCuD-9BSy2E7BWY3t5Sm
    • [] Simonson: Dynamic programming II - Lecture 12: https://www.youtube.com/watch?v=v1qiRwuJU7g&list=PLFDnELG9dpVQCuD-9BSy2E7BWY3t5Sm&inde=12
    • [] List of individual DP problems (each is short): https://www.youtube.com/playlist?list=PLrmLmBdmIlpsHaNTPP_jHHD_os9ItYr
  • [] Yale Lecture notes:
    • [] http://www.cs.yale.edu/homes/aspnes/classes/223/notes.html#dynamicProgramming
  • [] Coursera:
    • [] The RNA secondary structure problem: https://www.coursera.org/learn/algorithmic-thinking-2/lecture/80RrW/the-rna-secondary-structure-problem
    • [] A dynamic programming algorithm: https://www.coursera.org/learn/algorithmic-thinking-2/lecture/PSonq/a-dynamic-programming-algorithm
    • [] Illustrating the DP algorithm: https://www.coursera.org/learn/algorithmic-thinking-2/lecture/oUEK2/illustrating-the-dp-algorithm
    • [] Running time of the DP algorithm: https://www.coursera.org/learn/algorithmic-thinking-2/lecture/nfK2r/running-time-of-the-dp-algorithm
    • [] DP vs. recursive implementation: https://www.coursera.org/learn/algorithmic-thinking-2/lecture/M999a/dp-vs-recursive-implementation
    • [] Global pairwise sequence alignment: https://www.coursera.org/learn/algorithmic-thinking-2/lecture/UZ7o6/global-pairwise-sequence-alignment
    • [] Local pairwise sequence alignment: https://www.coursera.org/learn/algorithmic-thinking-2/lecture/WnNau/local-pairwise-sequence-alignment

• Combinatorics (n choose k) & Probability

  • [] Math Skills: How to find Factorial, Permutation and Combination (Choose): https://www.youtube.com/watch?v=8RRo6Ti9d0U
  • [] Make School: Probability: https://www.youtube.com/watch?v=sZkAAk9Wwa4
  • [] Make School: More Probability and Markov Chains: https://www.youtube.com/watch?v=dNaJg-mLobQ
  • [] Khan Academy:
    • Course layout:
      • [] https://www.khanacademy.org/math/probability/probability-and-combinatorics-topic
    • Just the videos - 41 (each are simple and each are short):
      • [] https://www.youtube.com/watch?v=uzkc-qNVoOk&list=PLC58778F28211FA19

• NP, NP-Complete and Approimation Algorithms

  • 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.
  • Know what NP-complete means.
  • [] Computational Compleity: https://www.youtube.com/watch?v=moPtwq_cVH8&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb&inde=23
  • Simonson:
    • [] https://youtu.be/qcGnJ47Smlo?list=PLFDnELG9dpVQCuD-9BSy2E7BWY3t5Sm&t=2939
    • [] https://www.youtube.com/watch?v=e0tGC6ZQdQE&inde=16&list=PLFDnELG9dpVQCuD-9BSy2E7BWY3t5Sm
    • https://www.youtube.com/watch?v=fC1BGT3wjE&inde=17&list=PLFDnELG9dpVQCuD-9BSy2E7BWY3t5Sm
    • https://www.youtube.com/watch?v=NKLDp3Rch3M&list=PLFDnELG9dpVQCuD-9BSy2E7BWY3t5Sm&inde=18
  • Skiena:
    • [] CSE373 2012 - Lecture 23 - Introduction to NP-Completeness: https://youtu.be/KiK5TVgbFg?list=PLOtl7M3yp-DV69F32zdK7YJcNpTunF2b&t=1508
    • CSE373 2012 - Lecture 24 - NP-Completeness Proofs: https://www.youtube.com/watch?v=27Al523hd4&inde=24&list=PLOtl7M3yp-DV69F32zdK7YJcNpTunF2b
    • CSE373 2012 - Lecture 25 - NP-Completeness Challenge: https://www.youtube.com/watch?v=CPH4gwIIM&inde=25&list=PLOtl7M3yp-DV69F32zdK7YJcNpTunF2b
  • [] Compleity: P, NP, NP-completeness, Reductions: https://www.youtube.com/watch?v=eHZifpgyH_4&list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp&inde=22
  • [] Compleity: Approimation Algorithms: https://www.youtube.com/watch?v=MEz1J9wY2iM&list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp&inde=24
  • Compleity: Fied-Parameter Algorithms: https://www.youtube.com/watch?v=4q-jmGrmKs&inde=25&list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp
  • Peter Norvik discusses near-optimal solutions to traveling salesman problem:
    • http://nbviewer.jupyter.org/url/norvig.com/ipython/TSP.ipynb
  • Pages 1048 - 1140 in CLRS if you have it.

• Garbage collection

  • [] Garbage collection (Java); Augmenting data str: https://www.youtube.com/watch?v=StdfeaKGEc&list=PL-v-cvA_iAlnI-BQr9hjqADPBtujFJd&inde=25
  • [] Compilers: https://www.youtube.com/playlist?list=PLO9y7hOkmmSGTy5z6HZ-W4k2y8WF7Bff
  • [] GC in Python: https://www.youtube.com/watch?v=iHVs_HkjdmI
  • [] Deep Dive Java: Garbage Collection is Good!: https://www.infoq.com/presentations/garbage-collection-benefits
  • [] Deep Dive Python: Garbage Collection in CPython: https://www.youtube.com/watch?v=P-8Z0-MhdQs&list=PLdzf4Clw0VbOEWOS_sLhT_9zaiQDrS5AR&inde=3

• Caches

  • [] LRU cache:
    • [] The Magic of LRU Cache (100 Days of Google Dev): https://www.youtube.com/watch?v=R5ON3iw78M
    • [] Implementing LRU: https://www.youtube.com/watch?v=bq6N7Ym81iI
    • [] LeetCode - 146 LRU Cache (C++): https://www.youtube.com/watch?v=8-FZRAjR7qU
  • [] CPU cache:
    • [] MIT 6.004 L15: The Memory Hierarchy: https://www.youtube.com/watch?v=vjYF_fAZI5E&list=PLrRW1w6CGAcbMtDFj205vALOGmiRc82-&inde=24
    • [] MIT 6.004 L16: Cache Issues: https://www.youtube.com/watch?v=ajgC3-pyGlk&inde=25&list=PLrRW1w6CGAcbMtDFj205vALOGmiRc82-

• Processes and Threads

  • [] Computer Science 162 - Operating Systems (25 videos):
    • for precesses and threads see videos 1-11
    • https://www.youtube.com/playlist?list=PL-v-cvA_iBDyz-ba4yDskqMDY6A1w_c
  • https://www.quora.com/What-is-the-difference-between-a-process-and-a-thread
  • Covers:
    • Processes, Threads, Concurrency issues
      • difference between processes and threads
      • processes
      • threads
      • locks
      • mutees
      • semaphores
      • monitors
      • how they work
      • deadlock
      • livelock
    • CPU activity, interrupts, contet switching
    • Modern concurrency constructs with multicore processors
    • Process resource needs (memory: code, static storage, stack, heap, and also file descriptors, i/o)
    • Thread resource needs (shares above (minus stack) with other threads in same process but each has its own pc, stack counter, registers and stack)
    • Forking is really copy on write (read-only) until the new process writes to memory, then it does a full copy.
    • Contet switching
      • How contet switching is initiated by the operating system and underlying hardware
  • [] threads in C++ (series - 10 videos): https://www.youtube.com/playlist?list=PL5jc9FGsL8E12so1wlMS0r0hTQoJL74M
  • [] concurrency in Python:
    • [] Short series on threads: https://www.youtube.com/playlist?list=PL1H1sBF1VAKVMONJWJkmUh6_p8g4F2oy1
    • [] Python Threads: https://www.youtube.com/watch?v=Bs7vPNbB9JM
    • [] Understanding the Python GIL (2010): https://www.youtube.com/watch?v=Obt-vMVdM8s
      • reference: http://www.dabeaz.com/GIL
    • [] David Beazley - Python Concurrency From the Ground Up: LIVE! - PyCon 2015: https://www.youtube.com/watch?v=MCs5OvhV9S4
    • [] Keynote David Beazley - Topics of Interest (Python Asyncio): https://www.youtube.com/watch?v=ZzfHjytDceU
    • [] Mute in Python: https://www.youtube.com/watch?v=0zaPs8OtyKY

  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. Epect to spend quite a bit of time on this.

• System Design, Scalability, Data Handling

  • Considerations from Yegge:
    • scalability
      • Distill large data sets to single values
      • Transform one data set to another
      • Handling obscenely large amounts of data
    • system design
      • features sets
      • interfaces
      • class hierarchies
      • designing a system under certain constraints
      • simplicity and robustness
      • tradeoffs
      • performance analysis and optimization
  • [] START HERE: System Design from HiredInTech: http://www.hiredintech.com/system-design/
  • [] https://www.quora.com/How-do-I-prepare-to-answer-design-questions-in-a-technical-interview?redirected_qid=1500023
  • [] 8 Things You Need to Know Before a System Design Interview: http://blog.gainlo.co/inde.php/2015/10/22/8-things-you-need-to-know-before-system-design-interviews/
  • [] Algorithm design: http://www.hiredintech.com/algorithm-design/
  • [] Database Normalization - 1NF, 2NF, 3NF and 4NF: https://www.youtube.com/watch?v=UrYLYV7WSHM
  • [] https://github.com/checkcheckzz/system-design-interview - There are a lot of resources in this one. Look through the articles and eamples. I put some of them below.
  • [] How to ace a systems design interview: http://www.palantir.com/2011/10/how-to-rock-a-systems-design-interview/
  • [] Numbers Everyone Should Know: http://everythingisdata.wordpress.com/2009/10/17/numbers-everyone-should-know/
  • [] How long does it take to make a contet switch?: http://blog.tsunanet.net/2010/11/how-long-does-it-take-to-make-contet.html
  • [] Transactions Across Datacenters: https://www.youtube.com/watch?v=srOgpECblk
  • [] A plain english introduction to CAP Theorem: http://ksat.me/a-plain-english-introduction-to-cap-theorem/
  • [] Paos Consensus algorithm:
    • short video: https://www.youtube.com/watch?v=s8JqcZtvnsM
    • etended video with use case and multi-paos: https://www.youtube.com/watch?v=JEpsBg0AO6o
    • paper: http://research.microsoft.com/en-us/um/people/lamport/pubs/paos-simple.pdf
  • [] Consistent Hashing: http://www.tom-e-white.com/2007/11/consistent-hashing.html
  • [] NoSQL Patterns: http://horicky.blogspot.com/2009/11/nosql-patterns.html
  • [] Optional: UML 2.0 Series: https://www.youtube.com/watch?v=OkC7HKtiZC0&list=PLGLfVvz_LVvQ5G-LdJ8RLqe-ndo7QITYc
  • [] OOSE: Software Dev Using UML and Java (21 videos):
    • Can skip this if you have a great grasp of OO and OO design practices.
    • https://www.youtube.com/playlist?list=PLJ9pm_Rc9HesnkwKlal_buSIHA-jTZMpO
  • [] SOLID OOP Principles:
    • [] Bob Martin SOLID Principles of Object Oriented and Agile Design: https://www.youtube.com/watch?v=TMuno5RZNeE
    • [] SOLID Design Patterns in C#: https://www.youtube.com/playlist?list=PL8m4NUhTQU48oiGCSgCP1FiJEcg_JzyQ
    • [] SOLID Principles: https://www.youtube.com/playlist?list=PL4CE9F710017EA77A
    • [] S - Single Responsibility Principle | Single responsibility to each Object
      • http://www.oodesign.com/single-responsibility-principle.html
      • http://www.javacodegeeks.com/2011/11/solid-single-responsibility-principle.html
      • more flavor: https://docs.google.com/open?id=0ByOwmqah_nuGNHEtcU5OekdDMkk
    • [] O - Open/Closed Principal | On production level Objects are ready for etension for not for modification
      • http://www.oodesign.com/open-close-principle.html
      • https://en.wikipedia.org/wiki/Open/closed_principle
      • more flavor: http://docs.google.com/a/cleancoder.com/viewer?a=v&pid=eplorer&chrome=true&srcid=0BwhCYaYDn8EgN2M5MTkwM2EtNWFkZC00ZTI3LWFjZTUtNTFhZGZiYmUzODc1&hl=en
    • [] L - Liskov Substitution Principal | Base Class and Derived class follow ‘IS A’ principal
      • http://www.oodesign.com/liskov-s-substitution-principle.html
      • http://stackoverflow.com/questions/56860/what-is-the-liskov-substitution-principle
      • more flavor: http://docs.google.com/a/cleancoder.com/viewer?a=v&pid=eplorer&chrome=true&srcid=0BwhCYaYDn8EgNzAzZjA5ZmItNjU3NS00MzQ5LTkwYjMtMDJhNDU5ZTM0MTlh&hl=en
    • [] I - Interface segregation principle | clients should not be forced to implement interfaces they don't use
      • http://www.oodesign.com/interface-segregation-principle.html
      • Interface Segregation Principle in 5 minutes: https://www.youtube.com/watch?v=3CtAfl7aAQ
      • more flavor: http://docs.google.com/a/cleancoder.com/viewer?a=v&pid=eplorer&chrome=true&srcid=0BwhCYaYDn8EgOTViYjJhYzMtMzYMC00MzFjLWJjMzYtOGJiMDc5N2JkYmJi&hl=en
    • [] D - Dependency Inversion principle | Reduce the dependency In composition of objects.
      • http://www.oodesign.com/dependency-inversion-principle.html
      • http://stackoverflow.com/questions/62539/what-is-the-dependency-inversion-principle-and-why-is-it-important
      • more flavor: http://docs.google.com/a/cleancoder.com/viewer?a=v&pid=eplorer&chrome=true&srcid=0BwhCYaYDn8EgMjdlMWIzNGUtZTQ0NC00ZjQ5LTkwYzQtZjRhMDRlNTQ3ZGMz&hl=en
  • [] Scalability:
    • [] Great overview: https://www.youtube.com/watch?v=-W9F__D3oY4
    • [] Short series:
      • http://www.lecloud.net/post/7295452622/scalability-for-dummies-part-1-clones
      • http://www.lecloud.net/post/7994751381/scalability-for-dummies-part-2-database
      • http://www.lecloud.net/post/9246290032/scalability-for-dummies-part-3-cache
      • http://www.lecloud.net/post/9699762917/scalability-for-dummies-part-4-asynchronism
    • [] Scalable Web Architecture and Distributed Systems: http://www.aosabook.org/en/distsys.html
    • [] Fallacies of Distributed Computing Eplained: https://pages.cs.wisc.edu/~zuyu/files/fallacies.pdf
    • [] Pragmatic Programming Techniques: http://horicky.blogspot.com/2010/10/scalable-system-design-patterns.html
      • etra: Google Pregel Graph Processing: http://horicky.blogspot.com/2010/07/google-pregel-graph-processing.html
    • [] Jeff Dean - Building Software Systems At Google and Lessons Learned: https://www.youtube.com/watch?v=modC5IWTJI
    • [] Introduction to Architecting Systems for Scale: http://lethain.com/introduction-to-architecting-systems-for-scale/
    • [] Scaling mobile games to a global audience using App Engine and Cloud Datastore: https://www.youtube.com/watch?v=9nWyWwY2Onc
    • [] How Google Does Planet-Scale Engineering for Planet-Scale Infra: https://www.youtube.com/watch?v=H4vMcD7zKM0
    • [] The Importance of Algorithms: https://www.topcoder.com/community/data-science/data-science-tutorials/the-importance-of-algorithms/
    • [] Sharding: http://highscalability.com/blog/2009/8/6/an-unorthodo-approach-to-database-design-the-coming-of-the.html
    • [] Scale at Facebook (2009): https://www.infoq.com/presentations/Scale-at-Facebook
    • [] Scale at Facebook (2012), "Building for a Billion Users": https://www.youtube.com/watch?v=oodS71YtkGU
    • [] Engineering for the Long Game - Astrid Atkinson Keynote: https://www.youtube.com/watch?v=p0jGmgIrf_M&list=PLRvay_m8gqVlEPC5DG3TGWJTaBgqSA&inde=4
    • [] 7 Years Of YouTube Scalability Lessons In 30 Minutes: http://highscalability.com/blog/2012/3/26/7-years-of-youtube-scalability-lessons-in-30-minutes.html
      • video: https://www.youtube.com/watch?v=G-lGCC4KKok
    • [] How PayPal Scaled To Billions Of Transactions Daily Using Just 8VMs: http://highscalability.com/blog/2016/8/15/how-paypal-scaled-to-billions-of-transactions-daily-using-ju.html
    • [] How to Remove Duplicates in Large Datasets: https://blog.clevertap.com/how-to-remove-duplicates-in-large-datasets/
    • [] A look inside Etsy's scale and engineering culture with Jon Cowie: https://www.youtube.com/watch?v=3vV4YiqKm1o
    • [] What Led Amazon to its Own Microservices Architecture: http://thenewstack.io/led-amazon-microservices-architecture/
    • [] To Compress Or Not To Compress, That Was Uber's Question: https://eng.uber.com/trip-data-squeeze/
    • [] Asyncio Tarantool Queue, Get In The Queue: http://highscalability.com/blog/2016/3/3/asyncio-tarantool-queue-get-in-the-queue.html
    • [] When Should Approimate Query Processing Be Used?: http://highscalability.com/blog/2016/2/25/when-should-approimate-query-processing-be-used.html
    • [] Google's Transition From Single Datacenter, To Failover, To A Native Multihomed Architecture: http://highscalability.com/blog/2016/2/23/googles-transition-from-single-datacenter-to-failover-to-a-n.html
    • [] Spanner: http://highscalability.com/blog/2012/9/24/google-spanners-most-surprising-revelation-nosql-is-out-and.html
    • [] Egnyte Architecture: Lessons Learned In Building And Scaling A Multi Petabyte Distributed System: http://highscalability.com/blog/2016/2/15/egnyte-architecture-lessons-learned-in-building-and-scaling.html
    • [] Machine Learning Driven Programming: A New Programming For A New World: http://highscalability.com/blog/2016/7/6/machine-learning-driven-programming-a-new-programming-for-a.html
    • [] The Image Optimization Technology That Serves Millions Of Requests Per Day: http://highscalability.com/blog/2016/6/15/the-image-optimization-technology-that-serves-millions-of-re.html
    • [] A Patreon Architecture Short: http://highscalability.com/blog/2016/2/1/a-patreon-architecture-short.html
    • [] Tinder: How Does One Of The Largest Recommendation Engines Decide Who You'll See Net?: http://highscalability.com/blog/2016/1/27/tinder-how-does-one-of-the-largest-recommendation-engines-de.html
    • [] Design Of A Modern Cache: http://highscalability.com/blog/2016/1/25/design-of-a-modern-cache.html
    • [] Live Video Streaming At Facebook Scale: http://highscalability.com/blog/2016/1/13/live-video-streaming-at-facebook-scale.html
    • [] A Beginner's Guide To Scaling To 11 Million+ Users On Amazon's AWS: http://highscalability.com/blog/2016/1/11/a-beginners-guide-to-scaling-to-11-million-users-on-amazons.html
    • [] How Does The Use Of Docker Effect Latency?: http://highscalability.com/blog/2015/12/16/how-does-the-use-of-docker-effect-latency.html
    • [] Does AMP Counter An Eistential Threat To Google?: http://highscalability.com/blog/2015/12/14/does-amp-counter-an-eistential-threat-to-google.html
    • [] A 360 Degree View Of The Entire Netfli Stack: http://highscalability.com/blog/2015/11/9/a-360-degree-view-of-the-entire-netfli-stack.html
    • [] Latency Is Everywhere And It Costs You Sales - How To Crush It: http://highscalability.com/latency-everywhere-and-it-costs-you-sales-how-crush-it
    • [] Serverless (very long, just need the gist): http://martinfowler.com/articles/serverless.html
    • [] What Powers Instagram: Hundreds of Instances, Dozens of Technologies: http://instagram-engineering.tumblr.com/post/13649370142/what-powers-instagram-hundreds-of-instances
    • [] Cinchcast Architecture - Producing 1,500 Hours Of Audio Every Day: http://highscalability.com/blog/2012/7/16/cinchcast-architecture-producing-1500-hours-of-audio-every-d.html
    • [] Justin.Tv's Live Video Broadcasting Architecture: http://highscalability.com/blog/2010/3/16/justintvs-live-video-broadcasting-architecture.html
    • [] Playfish's Social Gaming Architecture - 50 Million Monthly Users And Growing: http://highscalability.com/blog/2010/9/21/playfishs-social-gaming-architecture-50-million-monthly-user.html
    • [] TripAdvisor Architecture - 40M Visitors, 200M Dynamic Page Views, 30TB Data: http://highscalability.com/blog/2011/6/27/tripadvisor-architecture-40m-visitors-200m-dynamic-page-view.html
    • [] PlentyOfFish Architecture: http://highscalability.com/plentyoffish-architecture
    • [] Salesforce Architecture - How They Handle 1.3 Billion Transactions A Day: http://highscalability.com/blog/2013/9/23/salesforce-architecture-how-they-handle-13-billion-transacti.html
    • [] ESPN's Architecture At Scale - Operating At 100,000 Duh Nuh Nuhs Per Second: http://highscalability.com/blog/2013/11/4/espns-architecture-at-scale-operating-at-100000-duh-nuh-nuhs.html
    • [] See "Messaging, Serialization, and Queueing Systems" way below for info on some of the technologies that can glue services together
    • [] Twitter:
      • O'Reilly MySQL CE 2011: Jeremy Cole, "Big and Small Data at @Twitter": https://www.youtube.com/watch?v=5cKTP36HVgI
      • Timelines at Scale: https://www.infoq.com/presentations/Twitter-Timeline-Scalability
    • 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:
    • review: System Design from HiredInTech: http://www.hiredintech.com/system-design/
    • cheat sheet: https://github.com/jwasham/google-interview-university/blob/master/etras/cheat%20sheets/system-design.pdf
    • flow:
      1. Understand the problem and scope:
         • define the use cases, with interviewer's help
         • suggest additional features
         • remove items that interviewer deems out of scope
         • assume high availability is required, add as a use case
      2. Think about constraints:
         • ask how many requests per month
         • ask how many requests per second (they may volunteer it or make you do the math)
         • estimate reads vs. writes percentage
         • keep 80/20 rule in mind when estimating
         • how much data written per second
         • total storage required over 5 years
         • how much data read per second
      3. Abstract design:
         • layers (service, data, caching)
         • infrastructure: load balancing, messaging
         • rough overview of any key algorithm that drives the service
         • consider bottlenecks and determine solutions
    • Eercises:
      • Design a CDN network: old article: http://repository.cmu.edu/cgi/viewcontent.cgi?article=2112&contet=compsci
      • Design a random unique ID generation system: https://blog.twitter.com/2010/announcing-snowflake
      • Design an online multiplayer card game: http://www.indieflashblog.com/how-to-create-an-asynchronous-multiplayer-game.html
      • Design a key-value database: http://www.slideshare.net/dvirsky/introduction-to-redis
      • Design a function to return the top k requests during past time interval: https://icmi.cs.ucsb.edu/research/tech_reports/reports/2005-23.pdf
      • Design a picture sharing system: http://highscalability.com/blog/2011/12/6/instagram-architecture-14-million-users-terabytes-of-photos.html
      • Design a recommendation system: http://ijcai13.org/files/tutorial_slides/td3.pdf
      • Design a URL-shortener system: copied from above: http://www.hiredintech.com/system-design/the-system-design-process/
      • Design a cache system: https://www.adayinthelifeof.nl/2011/02/06/memcache-internals/

• About Google

  • [] How Search Works:
    • [] The Evolution of Search: https://www.youtube.com/watch?v=mTBShTwCnD4
    • [] How Search Works - the story: https://www.google.com/insidesearch/howsearchworks/thestory/
    • [] How Search Works: https://www.google.com/insidesearch/howsearchworks/
    • [] How Search Works - Matt Cutts: https://www.youtube.com/watch?v=BNHR6IQJGZs
    • [] How Google makes improvements to its search algorithm: https://www.youtube.com/watch?v=J5RZOU6vK4Q
  • [] Series:
    • [] https://backchannel.com/how-google-search-dealt-with-mobile-33bc09852dc9
    • [] https://backchannel.com/googles-secret-study-to-find-out-our-needs-eba8700263bf
    • [] https://backchannel.com/google-search-will-be-your-net-brain-5207c26e4523
    • [] https://backchannel.com/the-deep-mind-of-demis-hassabis-156112890d8a

• Papers

  • These are Google papers and well-known papers.
  • 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.
  • [] 1978: Communicating Sequential Processes: http://spinroot.com/courses/summer/Papers/hoare_1978.pdf
    • implemented in Go: https://godoc.org/github.com/thomas11/csp
    • Love classic papers? https://www.cs.cmu.edu/~crary/819-f09/
  • [] 2003: The Google File System: http://static.googleusercontent.com/media/research.google.com/en//archive/gfs-sosp2003.pdf
    • replaced by Colossus in 2012
  • [] 2004: MapReduce: Simplified Data Processing on Large Clusters: http://static.googleusercontent.com/media/research.google.com/en//archive/mapreduce-osdi04.pdf
    • mostly replaced by Cloud Dataflow?
  • [] 2007: What Every Programmer Should Know About Memory (very long, and the author encourages skipping of some sections): https://www.akkadia.org/drepper/cpumemory.pdf
  • [] 2012: Google's Colossus: https://www.wired.com/2012/07/google-colossus/
    • paper not available
  • [] 2012: AddressSanitizer: A Fast Address Sanity Checker:
    • paper: http://static.googleusercontent.com/media/research.google.com/en//pubs/archive/37752.pdf
    • video: https://www.useni.org/conference/atc12/technical-sessions/presentation/serebryany
  • [] 2013: Spanner: Google’s Globally-Distributed Database:
    • paper: http://static.googleusercontent.com/media/research.google.com/en//archive/spanner-osdi2012.pdf
    • video: https://www.useni.org/node/170855
  • [] 2014: Machine Learning: The High-Interest Credit Card of Technical Debt: http://static.googleusercontent.com/media/research.google.com/en//pubs/archive/43146.pdf
  • [] 2015: Continuous Pipelines at Google: http://static.googleusercontent.com/media/research.google.com/en//pubs/archive/43790.pdf
  • [] 2015: High-Availability at Massive Scale: Building Google’s Data Infrastructure for Ads: https://static.googleusercontent.com/media/research.google.com/en//pubs/archive/44686.pdf
  • [] 2015: TensorFlow: Large-Scale Machine Learning on Heterogeneous Distributed Systems: http://download.tensorflow.org/paper/whitepaper2015.pdf
  • [] 2015: How Developers Search for Code: A Case Study: http://static.googleusercontent.com/media/research.google.com/en//pubs/archive/43835.pdf
  • [] 2016: Borg, Omega, and Kubernetes: http://static.googleusercontent.com/media/research.google.com/en//pubs/archive/44843.pdf

• Unicode

  • [] The Absolute Minimum Every Software Developer Absolutely, Positively Must Know About Unicode and Character Sets: http://www.joelonsoftware.com/articles/Unicode.html
  • [] What Every Programmer Absolutely, Positively Needs To Know About Encodings And Character Sets To Work With Tet: http://kunststube.net/encoding/

• Emacs and vi(m)

  • suggested by Yegge, from an old Amazon recruiting post: Familiarize yourself with a uni-based code editor
  • vi(m):
    • https://www.youtube.com/watch?v=5givLEMcINQ&inde=1&list=PL13bz4SHGmRlZVmWQ9Dvo1fEg4UdGkr
    • set of 4:
      • https://www.youtube.com/watch?v=SI8TeVM8pk
      • https://www.youtube.com/watch?v=F3OO7ZIOaJE
      • https://www.youtube.com/watch?v=ZYEccA_nMaI
      • https://www.youtube.com/watch?v=1lYD5gwgZIA
    • http://www.cs.yale.edu/homes/aspnes/classes/223/notes.html#Using_Vi_instead_of_Emacs
  • emacs:
    • https://www.youtube.com/watch?v=hbmV1bnQ-i0
    • set of 3:
      • https://www.youtube.com/watch?v=ujODL7MD04Q
      • https://www.youtube.com/watch?v=WpsRupJ4II
      • https://www.youtube.com/watch?v=paSgzPso-yc
    • https://www.youtube.com/watch?v=JWD1Fpdd4Pc
    • http://www.cs.yale.edu/homes/aspnes/classes/223/notes.html#Writing_C_programs_with_Emacs
    • (maybe) Org Mode In Depth: Managing Structure: https://www.youtube.com/watch?v=nsGYet02bEk

• Uni command line tools

  • suggested by Yegge, from an old Amazon recruiting post. I filled in the list below from good tools.
  • bash
  • cat
  • grep
  • sed
  • awk
  • curl or wget
  • sort
  • tr
  • uniq
  • strace: https://en.wikipedia.org/wiki/Strace
  • tcpdump: https://danielmiessler.com/study/tcpdump/

• Testing

  • To cover:
    • how unit testing works
    • what are mock objects
    • what is integration testing
    • what is dependency injection
  • [] Agile Software Testing with James Bach: https://www.youtube.com/watch?v=SAhJf36_u5U
  • [] Open Lecture by James Bach on Software Testing: https://www.youtube.com/watch?v=ILkT_HV9DVU
  • [] Steve Freeman - Test-Driven Development (that’s not what we meant): https://vimeo.com/83960706
    • slides: http://gotocon.com/dl/goto-berlin-2013/slides/SteveFreeman_TestDrivenDevelopmentThatsNotWhatWeMeant.pdf
  • [] TDD is dead. Long live testing.: http://david.heinemeierhansson.com/2014/tdd-is-dead-long-live-testing.html
  • [] Is TDD dead? https://www.youtube.com/watch?v=z9quZsLcfo
  • [] Video series (152 videos) - not all are needed: https://www.youtube.com/watch?v=nzJapzH_rE&list=PLAwTw4SYaPkWVHeC_8aSIbSE_NI76g
  • [] Test-Driven Web Development with Python: http://www.obeythetestinggoat.com/pages/book.html#toc
  • [] Dependency injection:
    • [] https://www.youtube.com/watch?v=IKD2-MAkyQ
    • [] http://jasonpolites.github.io/tao-of-testing/ch3-1.1.html
  • [] How to write tests: http://jasonpolites.github.io/tao-of-testing/ch4-1.1.html

• Design patterns

  • [] Quick UML review: https://www.youtube.com/watch?v=3cmzqZzwNDM&list=PLGLfVvz_LVvQ5G-LdJ8RLqe-ndo7QITYc&inde=3
  • [] Learn these patterns:
    • [] strategy
    • [] singleton
    • [] adapter
    • [] prototype
    • [] decorator
    • [] visitor
    • [] factory, abstract factory
    • [] facade
    • [] observer
    • [] proy
    • [] delegate
    • [] command
    • [] state
    • [] memento
    • [] iterator
    • [] composite
    • [] flyweight
  • [] Chapter 6 (Part 1) - Patterns: https://youtu.be/LAP2A80Ajrg?list=PLJ9pm_Rc9HesnkwKlal_buSIHA-jTZMpO&t=3344
  • [] Chapter 6 (Part 2) - Abstraction-Occurrence, General Hierarchy, Player-Role, Singleton, Observer, Delegation: https://www.youtube.com/watch?v=U8-PGsjvZc4&inde=12&list=PLJ9pm_Rc9HesnkwKlal_buSIHA-jTZMpO
  • [] Chapter 6 (Part 3) - Adapter, Facade, Immutable, Read-Only Interface, Proy: https://www.youtube.com/watch?v=7sduBHue4c&inde=13&list=PLJ9pm_Rc9HesnkwKlal_buSIHA-jTZMpO
  • [] Series of videos (27 videos): https://www.youtube.com/playlist?list=PLF206E906175C7E07
  • [] Head First Design Patterns: https://www.amazon.com/Head-First-Design-Patterns-Freeman/dp/0596007124
    • I know the canonical book is "Design Patterns: Elements of Reusable Object-Oriented Software", but Head First is great for beginners to OO.
  • Handy reference: 101 Design Patterns & Tips for Developers: https://sourcemaking.com/design-patterns-and-tips

• Scheduling

  • in an OS, how it works
  • can be gleaned from Operating System videos

• Implement system routines

  • understand what lies beneath the programming APIs you use
  • can you implement them?

• String searching & manipulations

  • Search pattern in tet: https://www.coursera.org/learn/data-structures/lecture/tAfHI/search-pattern-in-tet
  • Rabin-Karp: https://www.coursera.org/learn/data-structures/lecture/c0Qkw/rabin-karps-algorithm https://www.youtube.com/watch?v=BRO7mVIFt08&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb&inde=9
  • Precomputing: https://www.coursera.org/learn/data-structures/lecture/nYrc8/optimization-precomputation
  • Optimization: Implementation and Analysis: https://www.coursera.org/learn/data-structures/lecture/h4ZLc/optimization-implementation-and-analysis
  • Knuth-Morris-Pratt (KMP):
    • https://en.wikipedia.org/wiki/Knuth%E2%80%93Morris%E2%80%93Pratt_algorithm
    • https://www.youtube.com/watch?v=2ogqPWJSftE
  • Boyer–Moore string search algorithm
    • https://en.wikipedia.org/wiki/Boyer%E2%80%93Moore_string_search_algorithm
    • https://www.youtube.com/watch?v=YBM0_dChRE
  • Coursera: Algorithms on Strings:
    • https://www.coursera.org/learn/algorithms-on-strings/home/week/1

---

Final Review

This section will have shorter videos that can you watch pretty quickly to review most of the important concepts.
It's nice if you want a refresher often.
(More items will be added here)

General:

• Series of 2-3 minutes short subject videos (23 videos)
  • https://www.youtube.com/watch?v=r4r1DZc1cM&list=PLmVb1OknmNJuC5POdcDv5oCS7_OUkDgpj&inde=22
• Series of 2-5 minutes short subject videos - Michael Sambol (18 videos):
  • https://www.youtube.com/channel/UCzDJwLWoYCUQowF_nG3m5OQ

Sorts:

• Merge Sort: https://www.youtube.com/watch?v=GCae1WNvnZM

Books

Mentioned in Google Coaching

Read and do eercises:

• The Algorithm Design Manual (Skiena)

  • Book (can rent on kindle):
    • http://www.amazon.com/Algorithm-Design-Manual-Steven-Skiena/dp/1849967202
  • Half.com is a great resource for tetbooks at good prices.
  • Answers:
    • http://www.algorithm.cs.sunysb.edu/algowiki/inde.php/The_Algorithms_Design_Manual_(Second_Edition)
    • http://blog.panictank.net/category/algorithmndesignmanualsolutions/page/2/
  • Errata:
    • http://www3.cs.stonybrook.edu/~skiena/algorist/book/errata

  Once you've understood everything in the daily plan, and read and done eercises from the the books above, read and do eercises from the books below. Then move to coding challenges (further down below)

Read first:

• Programming Interviews Eposed: Secrets to Landing Your Net Job, 2nd Edition: http://www.wiley.com/WileyCDA/WileyTitle/productCd-047012167.html

Read second (recommended by many, but not in Google coaching docs):

• Cracking the Coding Interview, 6th Edition:
  • http://www.amazon.com/Cracking-Coding-Interview-6th-Programming/dp/0984782850/
  • If you see people reference "The Google Resume", it was a book replaced by "Cracking the Coding Interview".

Additional books

These were not suggested by Google but I added because I needed the background knowledge

• [] C Programming Language, Vol 2

  • answers to questions: https://github.com/lekkas/c-algorithms

• [] C++ Primer Plus, 6th Edition

• [] The Uni Programming Environment

  • http://product.half.ebay.com/The-UNI-Programming-Environment-by-Brian-W-Kernighan-and-Rob-Pike-1983-Other/54385&tg=info

• Programming Pearls:

  • http://www.amazon.com/Programming-Pearls-2nd-Jon-Bentley/dp/0201657880

• Algorithms and Programming: Problems and Solutions: http://www.amazon.com/Algorithms-Programming-Solutions-Aleander-Shen/dp/0817638474

If you have time

• Introduction to Algorithms

  • https://www.amazon.com/Introduction-Algorithms-3rd-MIT-Press/dp/0262033844
  • Half.com is a great resource for tetbooks at good prices.

• Elements of Programming Interviews

  • https://www.amazon.com/Elements-Programming-Interviews-Insiders-Guide/dp/1479274836
  • all code is in C++, if you're looking to use C++ in your interview
  • good book on problem solving in general.

Coding eercises/challenges

Once you've learned your brains out, put those brains to work. Take coding challenges every day, as many as you can.

• [] Great intro (copied from System Design section): Algorithm design: http://www.hiredintech.com/algorithm-design/

• How to Find a Solution: https://www.topcoder.com/community/data-science/data-science-tutorials/how-to-find-a-solution/

• How to Dissect a Topcoder Problem Statement: https://www.topcoder.com/community/data-science/data-science-tutorials/how-to-dissect-a-topcoder-problem-statement/

• Mathematics for Topcoders: https://www.topcoder.com/community/data-science/data-science-tutorials/mathematics-for-topcoders/

• Dynamic Programming – From Novice to Advanced: https://www.topcoder.com/community/data-science/data-science-tutorials/dynamic-programming-from-novice-to-advanced/

• https://courses.csail.mit.edu/iap/interview/materials.php

  • LeetCode: https://leetcode.com/

  • TopCoder: https://www.topcoder.com/

  • Project Euler (math-focused): https://projecteuler.net/inde.php?section=problems

  • HackerRank: https://www.hackerrank.com/

  • Codility: https://codility.com/programmers/

  • InterviewCake: https://www.interviewcake.com/

  • InterviewBit: https://www.interviewbit.com/invite/icjf

  • Eercises for getting better at a given language: http://eercism.io/languages

Once you're closer to the interview

• Cracking The Coding Interview Set 2:
  • https://www.youtube.com/watch?v=4NIb9l3imAo
  • https://www.youtube.com/watch?v=Eg5-tdAwclo
  • https://www.youtube.com/watch?v=1fqMuPmGak

Your Resume

• http://steve-yegge.blogspot.co.uk/2007_09_01_archive.html
• Great stuff at the back of Cracking The Coding Interview

Be thinking of for when the interview comes

Think of about 20 interview questions you'll get, along 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 eisting Google product.
• How do you work best, as an individual and as part of a team?
• Which of your skills or eperiences would be assets in the role and why?
• What did you most enjoy at [job / project y]?
• What was the biggest challenge you faced at [job / project y]?
• What was the hardest bug you faced at [job / project y]?
• What did you learn at [job / project y]?
• What would you have done better at [job / 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 is your dev cycle look like? Do you do waterfall/sprints/agile?
• Are rushes to deadlines common? Or is there fleibility?
• 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?

---

---

Additional Learnings (not required)

Everything below is my recommendation, not Google's, and you may not have enough time to
learn, watch or read them all. That's ok. I may not either.

• Information theory

  • [] Khan Academy: https://www.khanacademy.org/computing/computer-science/informationtheory
  • [] more about Markov processes:
    • [] https://www.coursera.org/learn/data-structures-optimizing-performance/lecture/wag/core-markov-tet-generation
    • [] https://www.coursera.org/learn/data-structures-optimizing-performance/lecture/gZhiC/core-implementing-markov-tet-generation
    • [] https://www.coursera.org/learn/data-structures-optimizing-performance/lecture/EUjrq/project-markov-tet-generation-walk-through
  • See more in MIT 6.050J Information and Entropy series below.

• Parity & Hamming Code

  • [] Intro: https://www.youtube.com/watch?v=q-3BctoUpHE
  • [] Parity: https://www.youtube.com/watch?v=DdMcAUlh1M
  • [] Hamming Code:
    • Error detection: https://www.youtube.com/watch?v=1A_NcdoCc
    • Error correction: https://www.youtube.com/watch?v=JAMLudHH8o
  • [] Error Checking:
    • https://www.youtube.com/watch?v=wbH2VzmoZk

• Entropy

  • also see videos below
  • make sure to watch information theory videos first
  • [] Information Theory, Claude Shannon, Entropy, Redundancy, Data Compression & Bits: https://youtu.be/JnJq3Py0dyM?t=176

• Cryptography

  • also see videos below
  • make sure to watch information theory videos first
  • [] Khan Academy Series: https://www.khanacademy.org/computing/computer-science/cryptography
  • [] Cryptography: Hash Functions: https://www.youtube.com/watch?v=KqqOndnvic&list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp&inde=30
  • [] Cryptography: Encryptiom: https://www.youtube.com/watch?v=9TNI2wHmaeI&inde=31&list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp

• Compression

  • make sure to watch information theory videos first
  • [] Computerphile:
    • [] Compression: https://www.youtube.com/watch?v=Lto-ajuqW3w
    • [] Entropy in Compression: https://www.youtube.com/watch?v=M5c_RFKVkko
    • [] Upside Down Trees (Huffman Trees): https://www.youtube.com/watch?v=umTbivyJoiI
    • [] ETRA BITS/TRITS - Huffman Trees: https://www.youtube.com/watch?v=DV8efuB3h2g
    • [] Elegant Compression in Tet (The LZ 77 Method): https://www.youtube.com/watch?v=goOa3DGezUA
    • [] Tet Compression Meets Probabilities: https://www.youtube.com/watch?v=cCDCfoHTsaU
  • [] Compressor Head videos:
    • https://www.youtube.com/playlist?list=PLOU2LYmsIJGErt5rrCqaSGTMyyqNt2H
  • [] (optional) Google Developers Live: GZIP is not enough!: https://www.youtube.com/watch?v=whGwm0Lky2s

• Networking

  • [] Khan Academy: https://www.khanacademy.org/computing/computer-science/internet-intro
  • [] UDP and TCP: Comparison of Transport Protocols: https://www.youtube.com/watch?v=Vdc8TCESIg8
  • [] TCP/IP and the OSI Model Eplained!: https://www.youtube.com/watch?v=e5DEVa9eSN0
  • [] Packet Transmission across the Internet. Networking & TCP/IP tutorial.: https://www.youtube.com/watch?v=nomyRJehhnM
  • [] HTTP: https://www.youtube.com/watch?v=WGJrLqt7As
  • [] SSL and HTTPS: https://www.youtube.com/watch?v=S2iBR2ZlZf0
  • [] SSL/TLS: https://www.youtube.com/watch?v=Rp3iZUvWlM
  • [] HTTP 2.0: https://www.youtube.com/watch?v=E9FNzv1Tr8
  • Video Series (21 videos): https://www.youtube.com/playlist?list=PLEbnTDJUr_IegfoqO4iPnPYQui46QqT0j
  • [] Subnetting Demystified - Part 5 CIDR Notation: https://www.youtube.com/watch?v=t5YI0jzOf4

• Computer Security

  • MIT (23 videos): https://www.youtube.com/playlist?list=PLUl4u3cNGP62K2DjQLRDNRi0z2IRWnNh
    • [] Introduction, Threat Models: https://www.youtube.com/watch?v=GqmQg-cszw4&inde=1&list=PLUl4u3cNGP62K2DjQLRDNRi0z2IRWnNh
    • [] Control Hijacking Attacks: https://www.youtube.com/watch?v=6bwzNg5qQ0o&list=PLUl4u3cNGP62K2DjQLRDNRi0z2IRWnNh&inde=2
    • [] Buffer Overflow Eploits and Defenses: https://www.youtube.com/watch?v=drQyrzRoRiA&list=PLUl4u3cNGP62K2DjQLRDNRi0z2IRWnNh&inde=3
    • [] Privilege Separation: https://www.youtube.com/watch?v=6SIJmoE9L9g&inde=4&list=PLUl4u3cNGP62K2DjQLRDNRi0z2IRWnNh
    • [] Capabilities: https://www.youtube.com/watch?v=8VqTSY-11F4&inde=5&list=PLUl4u3cNGP62K2DjQLRDNRi0z2IRWnNh
    • [] Sandboing Native Code: https://www.youtube.com/watch?v=VEV74hwASeU&list=PLUl4u3cNGP62K2DjQLRDNRi0z2IRWnNh&inde=6
    • [] Web Security Model: https://www.youtube.com/watch?v=chkFBigodIw&inde=7&list=PLUl4u3cNGP62K2DjQLRDNRi0z2IRWnNh
    • [] Securing Web Applications: https://www.youtube.com/watch?v=EBQIGy1ROLY&inde=8&list=PLUl4u3cNGP62K2DjQLRDNRi0z2IRWnNh
    • [] Symbolic Eecution: https://www.youtube.com/watch?v=yRVZPvHYHzw&inde=9&list=PLUl4u3cNGP62K2DjQLRDNRi0z2IRWnNh
    • [] Network Security: https://www.youtube.com/watch?v=SIEVvk3NVuk&inde=11&list=PLUl4u3cNGP62K2DjQLRDNRi0z2IRWnNh
    • [] Network Protocols: https://www.youtube.com/watch?v=QOtA76ga_fY&inde=12&list=PLUl4u3cNGP62K2DjQLRDNRi0z2IRWnNh
    • [] Side-Channel Attacks: https://www.youtube.com/watch?v=PuVMkSEcPiI&inde=15&list=PLUl4u3cNGP62K2DjQLRDNRi0z2IRWnNh

• Parallel Programming

  • [] Coursera (Scala): https://www.coursera.org/learn/parprog1/home/week/1
  • [] Efficient Python for High Performance Parallel Computing: https://www.youtube.com/watch?v=uY85GkaYzBk

• Messaging, Serialization, and Queueing Systems

  • [] Thrift
    • https://thrift.apache.org/
    • http://thrift-tutorial.readthedocs.io/en/latest/intro.html
  • [] Protocol Buffers
    • https://developers.google.com/protocol-buffers/
    • https://developers.google.com/protocol-buffers/docs/tutorials
  • [] gRPC
    • http://www.grpc.io/
    • https://www.youtube.com/watch?v=5tmPvSe7Q&list=PLcTqM9n_dieN0k1nSeN36Z_ppKnvMJoly&inde=1
  • [] Redis
    • http://redis.io/
    • tutorial: http://try.redis.io/
  • [] Amazon SQS (queue)
    • https://aws.amazon.com/sqs/
  • [] Amazon SNS (pub-sub)
    • https://aws.amazon.com/sns/
  • [] RabbitMQ
    • https://www.rabbitmq.com/
    • https://www.rabbitmq.com/getstarted.html
  • [] Celery
    • http://www.celeryproject.org/
    • http://docs.celeryproject.org/en/latest/getting-started/first-steps-with-celery.html
  • [] ZeroMQ
    • http://zeromq.org/
    • http://zeromq.org/intro:read-the-manual
  • [] ActiveMQ
    • http://activemq.apache.org/
  • [] Kafka
    • http://kafka.apache.org/documentation.html#introduction
  • [] MessagePack
    • http://msgpack.org/inde.html
  • [] Avro
    • https://avro.apache.org/

• Fast Fourier Transform

  • [] What is a Fourier transform? What is it used for?: http://www.askamathematician.com/2012/09/q-what-is-a-fourier-transform-what-is-it-used-for/
  • [] What is the Fourier Transform?: https://www.youtube.com/watch?v=ut2PN-V8Q
  • [] Divide & Conquer: FFT: https://www.youtube.com/watch?v=iTMn0Kt18tg&list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp&inde=4
  • [] http://jakevdp.github.io/blog/2013/08/28/understanding-the-fft/

• Bloom Filter

  • Given a Bloom filter with m bits and k hashing functions, both insertion and membership testing are O(k)
  • https://www.youtube.com/watch?v=-SuTGoFYjZs
  • https://www.youtube.com/watch?v=qBTdukbzc78
  • http://billmill.org/bloomfilter-tutorial/
  • http://blog.michaelschmatz.com/2016/04/11/how-to-write-a-bloom-filter-cpp/

• van Emde Boas Trees

  • [] Divide & Conquer: van Emde Boas Trees: https://www.youtube.com/watch?v=hmReJCupbNU&list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp&inde=6
  • [] https://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-046j-design-and-analysis-of-algorithms-spring-2012/lecture-notes/MIT6_046JS12_lec15.pdf

• Augmented Data Structures

  • [] CS 61B Lecture 39: Augmenting Data Structures: https://youtu.be/zksIj9O8_jc?list=PL4BBB74C7D2A1049C&t=950

• Skip lists

  • "These are somewhat of a cult data structure" - Skiena
  • [] Randomization: Skip Lists: https://www.youtube.com/watch?v=2g9OSRKJuzM&inde=10&list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp
  • [] For animations and a little more detail: https://en.wikipedia.org/wiki/Skip_list

• Network Flows

  • [] Ford-Fulkerson in 5 minutes: https://www.youtube.com/watch?v=v1VgJmkEJW0
  • [] Ford-Fulkerson Algorithm: https://www.youtube.com/watch?v=v1VgJmkEJW0
  • [] Network Flows: https://www.youtube.com/watch?v=2vhN4Ice5jI

• Disjoint Sets & Union Find

  • [] https://en.wikipedia.org/wiki/Disjoint-set_data_structure
  • [] UCB 61B - Disjoint Sets; Sorting & selection: https://www.youtube.com/watch?v=MAEGTwmUsI&list=PL-v-cvA_iAlnI-BQr9hjqADPBtujFJd&inde=21
  • [] Coursera (not needed since the above video eplains it great):
    • [] https://www.coursera.org/learn/data-structures/lecture/JssSY/overview
    • [] https://www.coursera.org/learn/data-structures/lecture/EM5D0/naive-implementations
    • [] https://www.coursera.org/learn/data-structures/lecture/Mu0w/trees
    • [] https://www.coursera.org/learn/data-structures/lecture/qb4c2/union-by-rank
    • [] https://www.coursera.org/learn/data-structures/lecture/Q9CVI/path-compression
    • [] https://www.coursera.org/learn/data-structures/lecture/GQQLN/analysis-optional

• Math for Fast Processing

  • [] Integer Arithmetic, Karatsuba Multiplication: https://www.youtube.com/watch?v=eCalAaN2uE&inde=11&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb
  • [] The Chinese Remainder Theorem (used in cryptography): https://www.youtube.com/watch?v=ru7mWZJlRQg

• Treap

  • Combination of a binary search tree and a heap
  • [] Wikipedia: https://en.wikipedia.org/wiki/Treap
  • [] https://www.youtube.com/watch?v=6podLUYinH8
  • [] Applications in set operations: https://www.cs.cmu.edu/~scandal/papers/treaps-spaa98.pdf

• Linear Programming

  • [] https://www.youtube.com/watch?v=M4K6HYLHREQ
  • [] Finding minimum cost: https://www.youtube.com/watch?v=2ACJ9ewUC6U
  • [] Finding maimum value: https://www.youtube.com/watch?v=8AA_81I3ik

• Geometry, Conve hull

  • [] Graph Alg. IV: Intro to geometric algorithms - Lecture 9: https://youtu.be/IAQRlNkJAw?list=PLFDnELG9dpVQCuD-9BSy2E7BWY3t5Sm&t=3164
  • [] Geometric Algorithms: Graham & Jarvis - Lecture 10: https://www.youtube.com/watch?v=J5aJEcOr6Eo&inde=10&list=PLFDnELG9dpVQCuD-9BSy2E7BWY3t5Sm
  • [] Divide & Conquer: Conve Hull, Median Finding: https://www.youtube.com/watch?v=EzeYI7p9MjU&list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp&inde=2

• Discrete math

  • see videos below

• Machine Learning

  • [] Why ML?
    • [] https://backchannel.com/how-google-is-remaking-itself-as-a-machine-learning-first-company-ada63defcb70
    • [] Large-Scale Deep Learning for Intelligent Computer Systems: https://www.youtube.com/watch?v=QSaZGT4-6EY
    • [] Deep Learning and Understandability versus Software Engineering and Verification by Peter Norvig: https://www.youtube.com/watch?v=769cyzBNVw
  • Google's Cloud Machine learning tools: https://www.youtube.com/watch?v=Ja2hBAwG_0
  • Google Developers' Machine Learning Recipes (Scikit Learn & Tensorflow):
    • https://www.youtube.com/playlist?list=PLOU2LYmsIIuiBfYad6rFYQU_jL2ryal
  • [] Tensorflow: https://www.youtube.com/watch?v=oZikw5k_2FM
  • Tensorflow Tutorials: https://www.tensorflow.org/versions/r0.11/tutorials/inde.html
  • Practical Guide to implementing Neural Networks in Python (using Theano): http://www.analyticsvidhya.com/blog/2016/04/neural-networks-python-theano/
  • Vector calculus: https://www.youtube.com/watch?v=tDtYAddb4o4
  • Courses:
    • [] Great starter course: Machine Learning: https://www.coursera.org/learn/machine-learning - videos only: https://www.youtube.com/playlist?list=PLZ9qNFMHZ-A4rycgrgOYma6zF4BZGGPW - see videos 12-18 for a review of linear algebra (14 and 15 are duplicates)
    • Neural Networks for Machine Learning: https://www.coursera.org/learn/neural-networks
    • Google's Deep Learning Nanodegree: https://www.udacity.com/course/deep-learning--ud730
    • Google/Kaggle Machine Learning Engineer Nanodegree: https://www.udacity.com/course/machine-learning-engineer-nanodegree-by-google--nd009
    • Self-Driving Car Engineer Nanodegree: https://www.udacity.com/drive
    • Metis Online Course ($99 for 2 months): http://www.thisismetis.com/eplore-data-science
  • Resources:
    • Great book: Data Science from Scratch: First Principles with Python: https://www.amazon.com/Data-Science-Scratch-Principles-Python/dp/149190142
    • Data School: http://www.dataschool.io/

• Go

  • [] Videos:
    • [] Why Learn Go?: https://www.youtube.com/watch?v=FTl0tl9BGdc
    • [] Go Programming: https://www.youtube.com/watch?v=CF9S4QZuV30
    • [] A Tour of Go: https://www.youtube.com/watch?v=ytEkHepK08c
  • [] Books:
    • [] An Introduction to Programming in Go (read free online): https://www.golang-book.com/books/intro
    • The Go Programming Language (Donovan & Kernighan): https://www.amazon.com/Programming-Language-Addison-Wesley-Professional-Computing/dp/0134190440
  • Bootcamp: https://www.golang-book.com/guides/bootcamp

--

Additional Detail on Some Subjects

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?

• More Dynamic Programming

  • [] 6.006: Dynamic Programming I: Fibonacci, Shortest Paths: https://www.youtube.com/watch?v=OQ5jsbhAv_M&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb&inde=19
  • [] 6.006: Dynamic Programming II: Tet Justification, Blackjack: https://www.youtube.com/watch?v=ENyo7kNKeY&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb&inde=20
  • 6.006: DP III: Parenthesization, Edit Distance, Knapsack: https://www.youtube.com/watch?v=ocZMDMZwhCY&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb&inde=21
  • 6.006: DP IV: Guitar Fingering, Tetris, Super Mario Bros.: https://www.youtube.com/watch?v=tp4_UaVy8&inde=22&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb
  • 6.046: Dynamic Programming & Advanced DP: https://www.youtube.com/watch?v=Tw1k46ywN6E&inde=14&list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp
  • 6.046: Dynamic Programming: All-Pairs Shortest Paths: https://www.youtube.com/watch?v=NzgFUwOaoIw&list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp&inde=15
  • 6.046: Dynamic Programming (student recitation): https://www.youtube.com/watch?v=krZI60lKPek&list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp&inde=12

• Advanced Graph Processing

  • Synchronous Distributed Algorithms: Symmetry-Breaking. Shortest-Paths Spanning Trees: https://www.youtube.com/watch?v=mUBmcbbJNf4&list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp&inde=27
  • Asynchronous Distributed Algorithms: Shortest-Paths Spanning Trees: https://www.youtube.com/watch?v=kQ-UQAzcnzA&list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp&inde=28

• MIT Probability (mathy, and go slowly, which is good for mathy things):

  • [] MIT 6.042J - Probability Introduction: https://www.youtube.com/watch?v=SmFwFdESMHI&inde=18&list=PLB7540DEDD482705B
  • [] MIT 6.042J - Conditional Probability: https://www.youtube.com/watch?v=E6FbvM-FGZ8&inde=19&list=PLB7540DEDD482705B
  • [] MIT 6.042J - Independence: https://www.youtube.com/watch?v=l1BCv3qqW4A&inde=20&list=PLB7540DEDD482705B
  • MIT 6.042J - Random Variables: https://www.youtube.com/watch?v=MOfhhFaQdjw&list=PLB7540DEDD482705B&inde=21
  • MIT 6.042J - Epectation I: https://www.youtube.com/watch?v=gGlMSe7uEkA&inde=22&list=PLB7540DEDD482705B
  • MIT 6.042J - Epectation II: https://www.youtube.com/watch?v=oI9fMUqgfY&inde=23&list=PLB7540DEDD482705B
  • MIT 6.042J - Large Deviations: https://www.youtube.com/watch?v=q4mwO2qS2z4&inde=24&list=PLB7540DEDD482705B
  • MIT 6.042J - Random Walks: https://www.youtube.com/watch?v=56iFMY8QW2k&list=PLB7540DEDD482705B&inde=25

• Simonson: Approimation Algorithms: https://www.youtube.com/watch?v=oDniZCmNmNw&list=PLFDnELG9dpVQCuD-9BSy2E7BWY3t5Sm&inde=19

Video Series

Sit back and enjoy. "netfli and skill" :P

• List of individual Dynamic Programming problems (each is short):

  • https://www.youtube.com/playlist?list=PLrmLmBdmIlpsHaNTPP_jHHD_os9ItYr

• 86 Architecture, Assembly, Applications (11 videos)

  • https://www.youtube.com/playlist?list=PL038BE01D3BAEFDB0

• MIT 18.06 Linear Algebra, Spring 2005 (35 videos):

  • https://www.youtube.com/playlist?list=PLE7DDD91010BC51F8

• Ecellent - MIT Calculus Revisited: Single Variable Calculus:

  • https://www.youtube.com/playlist?list=PL3B08AE665AB9002A

• Computer Science 70, 001 - Spring 2015 - Discrete Mathematics and Probability Theory:

  • https://www.youtube.com/playlist?list=PL-v-cvA_iD8wQm8U0gG_Z1uHjImKFy

• Discrete Mathematics (19 videos):

  • https://www.youtube.com/playlist?list=PL3o9D4Dl2FJ9q0_gtFPh_H4POI5dK0yG

• CSE373 - Analysis of Algorithms (25 videos):

  • Skiena lectures from Algorithm Design Manual
  • https://www.youtube.com/watch?v=ZFjhkohHdAA&list=PLOtl7M3yp-DV69F32zdK7YJcNpTunF2b&inde=1

• UC Berkeley 61B (Spring 2014): Data Structures (25 videos):

  • https://www.youtube.com/watch?v=mFPmKGIrQs4&list=PL-v-cvA_iAlnI-BQr9hjqADPBtujFJd

• UC Berkeley 61B (Fall 2006): Data Structures (39 videos):

  • https://www.youtube.com/playlist?list=PL4BBB74C7D2A1049C

• UC Berkeley 61C: Machine Structures (26 videos):

  • https://www.youtube.com/watch?v=gJJeUFyuvvg&list=PL-v-cvA_iCl2-D-FS5mk0jFF6cYSJs_

• OOSE: Software Dev Using UML and Java (21 videos):

  • https://www.youtube.com/playlist?list=PLJ9pm_Rc9HesnkwKlal_buSIHA-jTZMpO

• UC Berkeley CS 152: Computer Architecture and Engineering (20 videos):

  • https://www.youtube.com/watch?v=UH0QYvtP7Rk&inde=20&list=PLkFD6_40KJIwEiwQ1dACwh-2Fuo32qr

• MIT 6.004: Computation Structures (49 videos):

  • https://www.youtube.com/playlist?list=PLrRW1w6CGAcbMtDFj205vALOGmiRc82-

• MIT 6.006: Intro to Algorithms (47 videos):

  • https://www.youtube.com/watch?v=HtSuA80QTyo&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb&nohtml5=False

• MIT 6.033: Computer System Engineering (22 videos):

  • https://www.youtube.com/watch?v=zm2VP0kHl1M&list=PL6535748F59DCA484

• MIT 6.034 Artificial Intelligence, Fall 2010 (30 videos):

  • https://www.youtube.com/playlist?list=PLUl4u3cNGP63gFHB6b-kVBiQHYe_4hSi

• MIT 6.042J: Mathematics for Computer Science, Fall 2010 (25 videos):

  • https://www.youtube.com/watch?v=L3LMbpZIKhQ&list=PLB7540DEDD482705B

• MIT 6.046: Design and Analysis of Algorithms (34 videos):

  • https://www.youtube.com/watch?v=2P-yW7LQr08&list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp

• MIT 6.050J: Information and Entropy, Spring 2008 (19 videos)

  • https://www.youtube.com/watch?v=phsQrZQupo&list=PL_2Bwul6T-A7OldmhGODImZL8KEVE387

• MIT 6.851: Advanced Data Structures (22 videos):

  • https://www.youtube.com/watch?v=T0yzrZL1py0&list=PLUl4u3cNGP61hsJNdULdudlRL493b-Zf&inde=1

• MIT 6.854: Advanced Algorithms, Spring 2016 (24 videos):

  • https://www.youtube.com/playlist?list=PL6ogFv-ieghdoGKGg2Bik3Gl1glBTEu8c

• MIT 6.858 Computer Systems Security, Fall 2014 ():

  • https://www.youtube.com/watch?v=GqmQg-cszw4&inde=1&list=PLUl4u3cNGP62K2DjQLRDNRi0z2IRWnNh

• Stanford: Programming Paradigms (17 videos)

  • Course on C and C++
  • https://www.youtube.com/watch?v=jTSvthW34GU&list=PLC0B8B318B7394B6F&nohtml5=False

• Introduction to Cryptography:

  • https://www.youtube.com/watch?v=2aHkqB2-46k&feature=youtu.be
  • more in series (not in order): https://www.youtube.com/channel/UC1usFRN4LCMcfIV7UjHNuQg

• Mining Massive Datasets - Stanford University (94 videos):

  • https://www.youtube.com/playlist?list=PLLssT5z_DsK9JDLcT8T62VtzwyW9LNepV

Maybe

http://www.gainlo.co/ - Mock interviewers from big companies

---

---

Once You've Got The Job

Congratulations!

• 10 things I wish I knew on my first day at Google: https://medium.com/@moonstorming/10-things-i-wish-i-knew-on-my-first-day-at-google-107581d87286#.livn7clw

Keep learning.

You're never really done.