Given an array and a number k where k is smaller than size of array, we need to find the k smallest elements in the given array. It is given that all array elements are distinct.
Input:
arr = [7, 10, 4, 3, 20, 15]
k = 2
Output: [3, 4]
challenge-13
Folders and files
| Name | Name | Last commit date | ||
|---|---|---|---|---|
parent directory.. | ||||