Engrain by ByteRush

DSA.09 2 concepts

Heaps and tries

Top-K problems and prefix problems.

  1. DSA.09.01Pattern 9: Heap / top-KCoreMid-levelBeing written
  2. DSA.09.02Pattern 10: TrieMid-levelBeing written

Interview questions in this module

  1. Find the k largest elements. Heap vs sorting vs quickselect?
  2. Keep a running median of a stream.
  3. How would you build autocomplete with a trie? How do you return the top suggestions quickly?