# 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 \leq$
`lst.length`

$\leq 10^3$ - $1 \leq$
`k`

$\leq 10^3$ - $-10^5 \leq$
`lst[i]`

$\leq 10^5$

## Examples

Level up your interview prep. Join Educative to access 70+ hands-on prep courses.