companyhub
DashboardCompaniesProblemsSheetsBookmarksRevisionsAnalyticsLeaderboardCompare
Settings
Sign in
DashboardCompaniesProblemsSheetsBookmarks
Hard

Smallest Range Covering Elements from K Lists

70.1% acceptance · asked by 10 companies

Solve on LeetCode
ArrayHash TableSliding WindowGreedySortingHeap (Priority Queue)

Workspace

Scratch, run, iterate — then submit on LeetCode

Custom input (stdin)

Console

Output appears here. Runs on the free Piston sandbox.

Your notes

Sign in to keep markdown notes on this problem — approach, complexity, gotchas.

Who asks this

Phonepe100Winzo100Lyft75Flipkart50Linkedin
38
Amazon38
Bloomberg25
Google25
Microsoft25
Meta13

Related problems

Two Sum
Easy
Merge Intervals
Medium
Best Time to Buy and Sell Stock
Easy
Group Anagrams
Medium
Number of Islands
Medium