Solution as on 12-09-2022 11:30 pm

Author: knockcat

2369. Check if There is a Valid Partition For The Array.cpp

@@ -0,0 +1,27 @@
+class Solution
+{
+    // 2369.✅ Check if There is a Valid Partition For The Array
+
+public:
+    bool validPartition(vector<int> &nums)
+    {
+        int n = nums.size();
+        vector<bool> dp(n + 1);
+
+        dp[0] = 1;
+
+        for (int i = 0; i < n; ++i)
+        {
+            if (dp[i])
+            {
+                if (i + 1 < n && nums[i] == nums[i + 1])
+                    dp[i + 2] = true;
+                if (i + 2 < n && nums[i] == nums[i + 1] && nums[i] == nums[i + 2])
+                    dp[i + 3] = true;
+                if (i + 2 < n && nums[i] == nums[i + 1] - 1 && nums[i] == nums[i + 2] - 2)
+                    dp[i + 3] = true;
+            }
+        }
+        return dp[n];
+    }
+};