My Friend's Info Edge Interview (Bucket Sort Surprise)
November 20, 2025 · 59 reads
Summary
My friend recently interviewed at Info Edge, facing the "Top K Frequent Elements" problem. Although he provided a correct min-heap solution, the interviewer pushed for a more optimal bucket sort approach, which he hadn't prepared for.