Data Structures for Coding Interviews in Python/

...

/

Challenge: Find k Smallest Elements in a List

Challenge: Find k Smallest Elements in a List

Try to solve the Find k Smallest Elements in a List problem.

We'll cover the following...

Statement

Given an unsorted list lst and an integer k, find the k smallest elements from the list using a Heap.

Constraints:

  • 1≤1 \leq lst.length ≤103\leq 10^3
...