myrtleTree33/cheatsheet.md

Last active December 31, 2019 13:12

Star (0) You must be signed in to star a gist
Fork (0) You must be signed in to fork a gist

Learn more about clone URLs
Clone this repository at <script src="https://gist.github.com/myrtleTree33/890df3d00c1f6c7a9e9474993bfaf3af.js"></script>
Save myrtleTree33/890df3d00c1f6c7a9e9474993bfaf3af to your computer and use it in GitHub Desktop.

Download ZIP

Technical Interview Cheat Sheet: Algorithms

Raw

cheatsheet.md

Technical Interview Cheat Sheet: Algorithms and Data Structures

Sorting algorithms

Quicksort: https://gist.github.com/myrtleTree33/c92c3cc7a5a2ca9717dbf5a7e7195299
Insertion Sort: https://gist.github.com/myrtleTree33/7b23aedf3f1424173b5b5685f623f33e
Merge Sort: https://gist.github.com/myrtleTree33/330a7f85600587580ee3191947ee87dc

Selection algorithms

// TODO

Heap

Min Heap
Max Heap (Opposite of Min Heap)

Linked Lists

Self-explanatory

Stacks / Queues

Self-explanatory

Hash tables

Trees / BST

Ways to represent a tree
DFS / BFS traversal
Red-Black Trees
Tree balancing algorithms
Tricks to find leaf of tree, etc.

Graphs

Ways to represent a graph
Djistrika's algorithm
DFS / BFS traversal

Bit manipulation

// TODO

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment