Back to Questions

Smallest Range Covering Elements from K Lists

75.7K views•Asked at Spotify•
Hard

Question Explain

You have $k$ lists of sorted integers. Find the smallest range that includes at least one number from each of the $k$ lists. Use a Min-Heap.

Start Trying This Question Simulation

Practice answering orally or with text to get instant AI feedback.

Practice with This Question

Other interview questions like this

Two Sum

104.4K views

Longest Substring Without Repeating Characters

62.2K views

Median of Two Sorted Arrays

107.8K views
Smallest Range Covering Elements from K Lists - Interview Question