Top-K Largest Elements in Every Sliding Window
Company: Citadel
Role: Software Engineer
Category: Coding & Algorithms
Difficulty: medium
Interview Round: Technical Screen
Overview: This question evaluates the ability to design and maintain an ordered data structure that efficiently tracks the top K largest values within a moving window over an array. It tests knowledge of sliding window techniques combined with balanced search trees or ordered sets, commonly used to assess data structure selection beyond simple heaps or monotonic queues. The question is a practical coding and algorithms problem targeting logarithmic-time updates.
Read the full Citadel Software Engineer interview experience this question came from