There can't be that many datastructures + algorithms that are asked about, since even those who did learn them forget most but the core ones. Linked-list, hash

There can't be that many datastructures + algorithms that are asked about, since even those who did learn them forget most but the core ones. Linked-list, hash table (closed/extensible), binary tree, balanced tree (of some kind unlikely remembered), traversals, priority-queue, maybe a graph representation and algorithm on it, some sorts, and big-O/complexity <-> algorithm's loops/recursion. The most basic knowledge is knowing when to make something into a Set/Hash vs searching an array/list (or sort the array to binary search). As for all the leetcode tricks, I've never practiced them or worked at a company that required passing such an interview.