Are these topics sufficient for interview prep for FANG and other top companies?

  • Arrays
  • Strings
  • Linked Lists
  • Hash Tables
  • Stacks and Queues
  • Binary Trees, Binary Search Trees
  • Heaps
  • Recursion and Backtracking
  • Dynamic Programming
  • Graphs

I am preparing above mentioned topics keeping FANG and other top company interviews in mind. Am I missing any other topics whose questions are frequently asked these days? (Like Tries, Minimum Spanning Trees, Disjoint sets, Union sets, Dijkstra’s shortest path, Red Black Trees, etc…)