| { |
| "id": 2443, |
| "name": "check-if-there-is-a-valid-partition-for-the-array", |
| "difficulty": "Medium", |
| "link": "https://leetcode.com/problems/check-if-there-is-a-valid-partition-for-the-array/", |
| "date": "2022-07-31", |
| "task_description": "You are given a **0-indexed** integer array `nums`. You have to partition the array into one or more **contiguous** subarrays. We call a partition of the array **valid** if each of the obtained subarrays satisfies **one** of the following conditions: The subarray consists of **exactly** `2,` equal elements. For example, the subarray `[2,2]` is good. The subarray consists of **exactly** `3,` equal elements. For example, the subarray `[4,4,4]` is good. The subarray consists of **exactly** `3` consecutive increasing elements, that is, the difference between adjacent elements is `1`. For example, the subarray `[3,4,5]` is good, but the subarray `[1,3,5]` is not. Return `true`_ if the array has **at least** one valid partition_. Otherwise, return `false`. **Example 1:** ``` **Input:** nums = [4,4,4,5,6] **Output:** true **Explanation:** The array can be partitioned into the subarrays [4,4] and [4,5,6]. This partition is valid, so we return true. ``` **Example 2:** ``` **Input:** nums = [1,1,1,2] **Output:** false **Explanation:** There is no valid partition for this array. ``` **Constraints:** `2 <= nums.length <= 105` `1 <= nums[i] <= 106`", |
| "test_case": [ |
| { |
| "label": "Example 1", |
| "input": "nums = [4,4,4,5,6]", |
| "output": "true " |
| }, |
| { |
| "label": "Example 2", |
| "input": "nums = [1,1,1,2]", |
| "output": "false " |
| } |
| ], |
| "constraints": [ |
| "2 <= nums.length <= 105", |
| "1 <= nums[i] <= 106" |
| ], |
| "python_template": "class Solution(object):\n def validPartition(self, nums):\n \"\"\"\n :type nums: List[int]\n :rtype: bool\n \"\"\"\n ", |
| "java_template": "class Solution {\n public boolean validPartition(int[] nums) {\n \n }\n}", |
| "metadata": { |
| "func_name": "validPartition" |
| } |
| } |
