FPEvalRepoPublic/LeetCodeMetaData

1{2  "id": 3705,3  "name": "find-the-largest-almost-missing-integer",4  "difficulty": "Easy",5  "link": "https://leetcode.com/problems/find-the-largest-almost-missing-integer/",6  "date": "2025-02-23",7  "task_description": "You are given an integer array `nums` and an integer `k`. An integer `x` is **almost missing** from `nums` if `x` appears in _exactly_ one subarray of size `k` within `nums`. Return the largest **almost missing** integer from `nums`. If no such integer exists, return `-1`. A **subarray** is a contiguous sequence of elements within an array. **Example 1:** **Input:** nums = [3,9,2,1,7], k = 3 **Output:** 7 **Explanation:** 1 appears in 2 subarrays of size 3: `[9, 2, 1]` and `[2, 1, 7]`. 2 appears in 3 subarrays of size 3: `[3, 9, 2]`, `[9, 2, 1]`, `[2, 1, 7]`. 3 appears in 1 subarray of size 3: `[3, 9, 2]`. 7 appears in 1 subarray of size 3: `[2, 1, 7]`. 9 appears in 2 subarrays of size 3: `[3, 9, 2]`, and `[9, 2, 1]`. We return 7 since it is the largest integer that appears in exactly one subarray of size `k`. **Example 2:** **Input:** nums = [3,9,7,2,1,7], k = 4 **Output:** 3 **Explanation:** 1 appears in 2 subarrays of size 4: `[9, 7, 2, 1]`, `[7, 2, 1, 7]`. 2 appears in 3 subarrays of size 4: `[3, 9, 7, 2]`, `[9, 7, 2, 1]`, `[7, 2, 1, 7]`. 3 appears in 1 subarray of size 4: `[3, 9, 7, 2]`. 7 appears in 3 subarrays of size 4: `[3, 9, 7, 2]`, `[9, 7, 2, 1]`, `[7, 2, 1, 7]`. 9 appears in 2 subarrays of size 4: `[3, 9, 7, 2]`, `[9, 7, 2, 1]`. We return 3 since it is the largest and only integer that appears in exactly one subarray of size `k`. **Example 3:** **Input:** nums = [0,0], k = 1 **Output:** -1 **Explanation:** There is no integer that appears in only one subarray of size 1. **Constraints:** `1 <= nums.length <= 50` `0 <= nums[i] <= 50` `1 <= k <= nums.length`",8  "test_case": [9    {10      "label": "Example 1",11      "input": "nums = [3,9,2,1,7], k = 3",12      "output": "7 "13    },14    {15      "label": "Example 2",16      "input": "nums = [3,9,7,2,1,7], k = 4",17      "output": "3 "18    },19    {20      "label": "Example 3",21      "input": "nums = [0,0], k = 1",22      "output": "-1 "23    }24  ],25  "constraints": [26    "1 appears in 2 subarrays of size 3: [9, 2, 1] and [2, 1, 7].",27    "2 appears in 3 subarrays of size 3: [3, 9, 2], [9, 2, 1], [2, 1, 7].",28    "3 appears in 1 subarray of size 3: [3, 9, 2].",29    "7 appears in 1 subarray of size 3: [2, 1, 7].",30    "9 appears in 2 subarrays of size 3: [3, 9, 2], and [9, 2, 1].",31    "1 appears in 2 subarrays of size 4: [9, 7, 2, 1], [7, 2, 1, 7].",32    "2 appears in 3 subarrays of size 4: [3, 9, 7, 2], [9, 7, 2, 1], [7, 2, 1, 7].",33    "3 appears in 1 subarray of size 4: [3, 9, 7, 2].",34    "7 appears in 3 subarrays of size 4: [3, 9, 7, 2], [9, 7, 2, 1], [7, 2, 1, 7].",35    "9 appears in 2 subarrays of size 4: [3, 9, 7, 2], [9, 7, 2, 1].",36    "1 <= nums.length <= 50",37    "0 <= nums[i] <= 50",38    "1 <= k <= nums.length"39  ],40  "python_template": "class Solution(object):\n    def largestInteger(self, nums, k):\n        \"\"\"\n        :type nums: List[int]\n        :type k: int\n        :rtype: int\n        \"\"\"\n        ",41  "java_template": "class Solution {\n    public int largestInteger(int[] nums, int k) {\n        \n    }\n}",42  "metadata": {43    "func_name": "largestInteger"44  }45}