Leetcode 2869. Minimum Operations to Collect Elements

Given an array where each operation pops the last element into your collection, return the minimum number of pops required so the collected set contains all integers 1..k. This is equivalent to finding the shortest suffix of nums that contains every value from 1 to k.