Binary search Quicksort Mergesort Dijkstra’s algorthim Depth first search Breadth first search Doubly linked list Semaphores and mutexes Make sure you k

Binary search Quicksort Mergesort Dijkstra’s algorthim Depth first search Breadth first search Doubly linked list Semaphores and mutexes Make sure you know the recursive versions of the algorithms, and that’s pretty much everything you ever need for a generic coding interview, and you might not even get asked a dynamic programming or a producer-consumer question. Maybe you need some more specialized data structures for a more specialized role (eg tries[0] and inverted indices, for a search job), but you probably already knew those if you were already doing that job. There’s just not that much to know. [0] https://en.wikipedia.org/wiki/Trie https://en.wikipedia.org/wiki/Trie