FPEvalRepoPublic/LeetCodeMetaData

1{2  "id": 3236,3  "name": "smallest-missing-integer-greater-than-sequential-prefix-sum",4  "difficulty": "Easy",5  "link": "https://leetcode.com/problems/smallest-missing-integer-greater-than-sequential-prefix-sum/",6  "date": "2023-12-23",7  "task_description": "You are given a **0-indexed** array of integers `nums`. A prefix `nums[0..i]` is **sequential** if, for all `1 <= j <= i`, `nums[j] = nums[j - 1] + 1`. In particular, the prefix consisting only of `nums[0]` is **sequential**. Return _the **smallest** integer_ `x` _missing from_ `nums` _such that_ `x` _is greater than or equal to the sum of the **longest** sequential prefix._ **Example 1:** ``` **Input:** nums = [1,2,3,2,5] **Output:** 6 **Explanation:** The longest sequential prefix of nums is [1,2,3] with a sum of 6. 6 is not in the array, therefore 6 is the smallest missing integer greater than or equal to the sum of the longest sequential prefix. ``` **Example 2:** ``` **Input:** nums = [3,4,5,1,12,14,13] **Output:** 15 **Explanation:** The longest sequential prefix of nums is [3,4,5] with a sum of 12. 12, 13, and 14 belong to the array while 15 does not. Therefore 15 is the smallest missing integer greater than or equal to the sum of the longest sequential prefix. ``` **Constraints:** `1 <= nums.length <= 50` `1 <= nums[i] <= 50`",8  "test_case": [9    {10      "label": "Example 1",11      "input": "nums = [1,2,3,2,5]",12      "output": "6 "13    },14    {15      "label": "Example 2",16      "input": "nums = [3,4,5,1,12,14,13]",17      "output": "15 "18    }19  ],20  "constraints": [21    "1 <= nums.length <= 50",22    "1 <= nums[i] <= 50"23  ],24  "python_template": "class Solution(object):\n    def missingInteger(self, nums):\n        \"\"\"\n        :type nums: List[int]\n        :rtype: int\n        \"\"\"\n        ",25  "java_template": "class Solution {\n    public int missingInteger(int[] nums) {\n        \n    }\n}",26  "metadata": {27    "func_name": "missingInteger"28  }29}