Available question text
Given M sorted lists of potentially different lengths, find the Kth smallest (or largest) element across all lists. Each individual list is sorted in ascending order. This problem is typically solved using a min-heap (priority queue) for an efficient k-way merge approach, achieving O(K log M) time complexity.
Related questions
Continue with questions that share topics or the same question type.
- Find the Kth Smallest Sum of a Matrix With Sorted Rows
Coding
- Kth Smallest Element in a Sorted Matrix
Coding
- Find First and Last Position of Element in Sorted Array
Coding · Array · Binary Search
- Find Next Greater Element in Sorted Array
Coding
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
Meta
Find the Kth Smallest Element Across Multiple Sorted Lists
Reported Nov 3, 2025 · 4 source reports
MID_LEVEL, SENIOR, STAFF
Source snapshot: Nov 12, 2026
View source