配列を連続した数値の集合に分割するPythonの練習問題

def isPossibleDivide(nums, k):
     nums = sorted(nums)
     for _ in range(len(nums)//k):
         minv = nums[0]
         for _ in range(k):
             if minv in nums:
                 nums.remove(a)
                 minv +=1
     return len(nums) == 0
 
 

def isPossibleDivide(nums, k):
     n = len(nums)
     if n % k ! = 0:
         return False
     # Record the possible numbers in a set
     s = set(nums)
     minList = list(s)
     minList.sort()
     # Store the number of occurrences of each number in a dictionary
     d = dict()
     for num in nums:
         if num not in d:
             d[num] = 0
         d[num] += 1
     # Determine if each group can be composed of k consecutive numbers
     m = n // k # m groups
     start = 0 # start position
     for mi in range(m):
         if start >= len(minList):
             return False
         minv = minList[start]
         flag = True
         t = start
         for key in range(minv, minv + k):
             if key not in d:
                 return False
             if d[key] < 1:
                 return False
             elif d[key] == 1:
                 d[key] -= 1
                 t += 1
             elif d[key] > 1:
                 d[key] -= 1
                 if flag:
                     start = t
                     flag = False
         if flag:
             start = t
     return True