Runtime: 574 ms (Top 89.21%) | Memory: 15.3 MB (Top 66.59%)

Author: AnasImloul

scripts/algorithms/S/Split Array into Consecutive Subsequences/Split Array into Consecutive Subsequences.py

@@ -1,16 +1,17 @@
+# Runtime: 574 ms (Top 89.21%) | Memory: 15.3 MB (Top 66.59%)
 
 import collections
 class Solution:
     def isPossible(self, nums: List[int]) -> bool:
-        
+
         counter = collections.Counter(nums)
         end = collections.defaultdict(int)
 
         for num in nums:
-            
+
             if counter[num]:
                 counter[num]-=1
-                
+
                 if end[num-1]:
                     end[num-1]-=1
                     end[num]+=1
@@ -20,4 +21,4 @@ def isPossible(self, nums: List[int]) -> bool:
                     end[num+2] +=1
                 else:
                     return False
-        return True
+        return True