Solution Review: Find k smallest elements in a List
Let’s solve the Find k Smallest Elements in a List problem.
Statement
Given an unsorted list lst
and an integer k
, find the k
smallest elements from the list using a Heap.
Constraints:
-
lst.length
-
k