Leetcode 3471. Find the Largest Almost Missing Integer
Find the largest integer that appears in exactly one contiguous subarray (sliding window) of length k in nums — return that integer or -1 if none. Equivalently, count for each value how many k-length subarrays contain it and pick the maximum value with count == 1.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Hello Interview Premium
Your account is free and you can post anonymously if you choose.