Engrain by ByteRush

DSA.08 2 concepts

Linked lists, intervals and greedy

Pointer manipulation, interval problems and greedy reasoning.

  1. DSA.08.01Pattern 7: Linked list techniques (fast/slow, reversal, dummy)CoreMid-levelBeing written
  2. DSA.08.02Pattern 8: Intervals and greedyCoreMid-levelBeing written

Interview questions in this module

  1. Detect a cycle in a linked list in O(1) space.
  2. Reverse a linked list iteratively and recursively.
  3. Merge overlapping intervals. Why sort first?
  4. How many meeting rooms are needed for a list of meetings?
  5. How do you know a greedy algorithm is correct?