Data structures and algorithms
We list what we believe are most important DS&A topics for working at a big tech companies.
    List-based data structures
      List
      Array
      Python List
      Linked List
      Queue, Stack
    Set, Map, and hashing
    Bit manipulation
    Tree - one of the most popular topics at big tech interviews
      Tree algorithms
        Tree traversal (BFS, DFS)
        Search and delete
        Insert
      Specialized trees
        Binary Search and Binary Search Tree
        Heaps - one of the most popular topics at big tech interviews
        Heapify and HeapSort
    Graph
      BFS & DFS for graphs, Adjacency matrix
    Computation complexity and asymptotic notation
    Basic sorting algorithms
      Insertion Sort
      Selection Sort
      Bubble Sort
      Merge Sort
    Intermediary algorithms
      Recursion, dynamic programming, backtracking - popular at Google
      Advanced sorting algorithms: Radix Sort, QuickSort
In addition to that in coding interviews, you will get problems that require mathematical calculations (including basics of statistics and geometry).
Topics we recommend deprioritizing while preparing for interviews:
    1.
    Sweep line algorithm
    2.
    Dijkstra's algorithm
Most recommended resources:
Last modified 3mo ago
Copy link