Technical Interview Study Guide
Tom-wang
Download "Technical Interview Study Guide"
Technical Interview Study Guide by Tom Wang (Ft. Hackathon Hackers)
Performed by
Tom-wangAbout
With interview season coming up, what better way is there to relearn all of your favorite algorithms and data structures than to annotate them on Genius?
If you’d like to contribute, be sure to annotate with a basic description, a picture/gif of what’s happening, big O notation, and even some sampl...
Technical Interview Study Guide Annotated
Searching:
Depth First Search (DFS)
Breadth First Search (BFS)
Binary Search
Linear (Brute Force)
Shortest Path by Dijkstra
Sorting:
Quicksort
Mergesort
Heapsort
Bubble Sort
Insertion Sort
Select Sort
Bucket Sort
Radix Sort
Data Structures:
Basic Array
Dynamic Array
Singly-Linked List
Doubly-Linked List
Skip List
Hash Table
Binary Search Tree
Cartresian Tree
B-Tree
Red-Black Tree
Splay Tree
AVL Tree
Heaps:
Linked List (Sorted)
Linked List (Unsorted)
Binary Heap
Binomial Heap
Fibonacci Heap
Graphs:
Adjacency List
Incidence List
Adjacency Matrix
Incidence Matrix
Data Science:
Bayes Theorem
Poisson Distribution
A/B Testing