NDA (and I'm working there) so no specifics. But I strongly suggest studying graphs, networking, less common data structures like tries/radix trees and min/max heaps, bit manipulation, and searching (BFS, DFS, binary search).
Sigiloso
Make sure to get working code in your coding interviews! A slightly better than naive solution is much better than a harder unfinished solution.