K Smallest Elements in an Unsorted Array

Problem You are given an unsorted array of integers nums and a non‑negative integer k. Return the k smallest elements from the array, sorted in ascending order. Constraints 0 <= k <= len(nums) <= 10^5 -10^9 <= nums[i] <= 10^9 Example Output: Explanation: The three smallest values in the array are 3, 4, and 7; they are returned in increasing order. Follow‑up Discuss alternative approaches to this problem, including full sorting, maintaining a max‑heap of size k, and…