3471. Find the Largest Almost Missing Integer

class Solution {
    public int largestInteger(int[] nums, int k) {
        int n = nums.length;
        int[] count = new int[51]; // values are 0..50 per constraints

        for (int start = 0; start <= n - k; start++) {
            boolean[] seen = new boolean[51];
            for (int i = start; i < start + k; i++) {
                seen[nums[i]] = true;
            }
            for (int v = 0; v <= 50; v++) {
                if (seen[v]) {
                    count[v]++;
                }
            }
        }

        int ans = -1;
        for (int v = 0; v <= 50; v++) {
            if (count[v] == 1) {
                ans = v; // ascending scan, so last match is the largest
            }
        }

        return ans;
    }
}

class Solution:
    def largestInteger(self, nums, k):
        n = len(nums)
        count = [0] * 51

        for start in range(n - k + 1):
            seen = [False] * 51

            for i in range(start, start + k):
                seen[nums[i]] = True

            for v in range(51):
                if seen[v]:
                    count[v] += 1

        ans = -1

        for v in range(51):
            if count[v] == 1:
                ans = v

        return ans

class Solution {
public:
    int largestInteger(vector<int>& nums, int k) {
        int n = nums.size();
        int count[51] = {0};

        for (int start = 0; start <= n - k; start++) {
            bool seen[51] = {false};

            for (int i = start; i < start + k; i++) {
                seen[nums[i]] = true;
            }

            for (int v = 0; v <= 50; v++) {
                if (seen[v]) {
                    count[v]++;
                }
            }
        }

        int ans = -1;

        for (int v = 0; v <= 50; v++) {
            if (count[v] == 1) {
                ans = v;
            }
        }

        return ans;
    }
};

/**
 * @param {number[]} nums
 * @param {number} k
 * @return {number}
 */
var largestInteger = function(nums, k) {
    const n = nums.length;
    const count = new Array(51).fill(0);

    for (let start = 0; start <= n - k; start++) {
        const seen = new Array(51).fill(false);

        for (let i = start; i < start + k; i++) {
            seen[nums[i]] = true;
        }

        for (let v = 0; v <= 50; v++) {
            if (seen[v]) {
                count[v]++;
            }
        }
    }

    let ans = -1;

    for (let v = 0; v <= 50; v++) {
        if (count[v] === 1) {
            ans = v;
        }
    }

    return ans;
};