Data structures:

vector/list

dictionary/hashmap/hash table

queue

priority queue

heap

Methods/Algorithms:

min/max

insert/delete

contains key

list comprehension

N.B. I've done most of my interviews in C and watching me code has been referred as "watching paint dry" because of all of the boilerplate code that I have to write.

It feels very standard, don't all language have it in their standard libs?

C# has all of this + LINQ (very handy list comprehension?)

Java probably too + it has streams

Idk about other

> It feels very standard, don't all language have it in their standard libs?

Many do. However, ease of use is an issue.

Some interviews don't allow you to look up the names of types & methods nor use IDEs that provide pop-up lists of types & method names.

You have to everything in a basic editor w/o IDE support.

dont forget graph theory. FB caught me off guard on a takehome project which involved contact tracing (very timely in 2021) Dyjkstra's algorithm (spelling?) and backward tracing through graph nodes

Yes, I forgot Depth-First Search/Traversal and Breadth-First Search/Traversal.

Those two algorithms are the workhorses of graph algorithms.

Advanced graph algorithms include Dijkstra's algorithm, Minimum Spanning Tree, Strongly Connected Components, among others.

In addition, dynamic programming (DP) also shows up as a more advanced algorithm/technique in high-level interviews.