Skip to main content

Resources Interview Prep

Overview of Materials Needed​

Language

Bitwise​

Reference​

Dynamic Programming​

Trie​

System Design​

Trees​

  • DFS/Topological Sort
    • Topological Sort
      • Not an actual sort but rather organizing a DAG into a sequential order of events from child (no dependencies) up to root
    • InOrder
    • PostOrder
    • PreOrder
    • Use Stack for iterative
  • BFS
    • use a queue for iterative
  • DFS
    • use a stack for iterative

Graphs​

Linked Lists​

Strings/Objects​

Selection​

Techniques​