List-based data structures
Set, Map, and hashing
Tree - one of the most popular topics at big tech interviews
Tree traversal (BFS, DFS)
Search and delete
Binary Search and Binary Search Tree
Heaps - one of the most popular topics at big tech interviews
Heapify and HeapSort
BFS & DFS for graphs, Adjacency matrix
Computation complexity and asymptotic notation
Basic sorting 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:
Sweep line algorithm
Most recommended resources:
Google’s Intro to Data Structures and Algorithms course on Udacity. It is focused on helping you pass a Google interview.
Data Structures and Algorithms Specialization. This was most recommended by Outtalent graduates.