1673. Find the Most Competitive Subsequence

class Solution {
    public int[] mostCompetitive(int[] nums, int k) {
        int n = nums.length;
        int[] result = new int[k];
        Stack<Integer> stack = new Stack<>();

        for (int i = 0; i < n; i++) {
            
            while (!stack.isEmpty() && nums[i] < stack.peek() && stack.size() + (n - i) > k) {
                stack.pop();
            }
            
           
            if (stack.size() < k) {
                stack.push(nums[i]);
            }
        }
        
        
        for (int i = k - 1; i >= 0; i--) {
            result[i] = stack.pop();
        }
        
        return result;
    }
}