Skip to content

Instantly share code, notes, and snippets.

@myrtleTree33
Last active December 31, 2019 13:12
Show Gist options
  • Save myrtleTree33/890df3d00c1f6c7a9e9474993bfaf3af to your computer and use it in GitHub Desktop.
Save myrtleTree33/890df3d00c1f6c7a9e9474993bfaf3af to your computer and use it in GitHub Desktop.
Technical Interview Cheat Sheet: Algorithms

Technical Interview Cheat Sheet: Algorithms and Data Structures

Sorting algorithms

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