added Divide Array in Sets of K Consecutive Numbers (medium)

Author: minhyeong-joe

Medium/DivideArrayInKConsecNums/README.md

@@ -0,0 +1,36 @@
+
+# Divide Array in Sets of K Consecutive Numbers
+[Leetcode Link](https://leetcode.com/problems/divide-array-in-sets-of-k-consecutive-numbers/)
+
+## Problem:
+
+Given an array of integers `nums` and a positive integer `k`, find whether it's possible to divide this array into sets of `k` consecutive numbers
+Return `True` if its possible otherwise return `False`.
+
+## Example:
+
+```
+Input: nums = [1,2,3,3,4,4,5,6], k = 4
+Output: true
+Explanation: Array can be divided into [1,2,3,4] and [3,4,5,6].
+```
+```
+Input: nums = [3,2,1,2,3,4,3,4,5,9,10,11], k = 3
+Output: true
+Explanation: Array can be divided into [1,2,3] , [2,3,4] , [3,4,5] and [9,10,11].
+```
+```
+Input: nums = [3,3,2,2,1,1], k = 3
+Output: true
+```
+```
+Input: nums = [1,2,3,4], k = 3
+Output: false
+Explanation: Each array should be divided in subarrays of size 3.
+```
+
+## Note:
+
+- 1 <= nums.length <= 10^5
+- 1 <= nums[i] <= 10^9
+- 1 <= k <= nums.length

Medium/DivideArrayInKConsecNums/solution.py

@@ -0,0 +1,34 @@
+from typing import List
+
+class Solution:
+ def isPossibleDivide(self, nums: List[int], k: int) -> bool:
+ # if array length is not divisible by k, then there can never be even sets of k intgers
+ if len(nums) % k != 0:
+ return False
+ # sort array
+ nums.sort()
+ while nums:
+ consecutiveSet = list()
+ consecutiveSet.append(nums[0])
+ for i in range(1, len(nums)+1):
+ # if out of bound, then not possible with remaining integers
+ if i == len(nums):
+ return False
+ # if current number is strictly ONE greater than prev one, add it to consecutive set (to be removed from array)
+ if nums[i] == consecutiveSet[-1] + 1:
+ consecutiveSet.append(nums[i])
+ elif nums[i] > consecutiveSet[-1] + 1:
+ return False
+ # if we found k consecutive integers, remove them from array and repeat
+ if len(consecutiveSet) == k:
+ for num in consecutiveSet:
+ nums.remove(num)
+ break
+ return True
+
+
+sol = Solution()
+nums = [3,2,1,2,3,4,3,4,5,9,10,11]
+k = 3
+print(f'Input: nums = {nums}, k = {k}')
+print("Output:", sol.isPossibleDivide(nums, k))

README.md

@@ -80,6 +80,7 @@ Languages used: Java and Python
  - [Design Linked List](Medium/DesignLinkedList)
  - [Single Number II](Medium/SingleNumber2)
  - [Count Square Submatrices with All Ones](Medium/CountSquareWithOnes)
+ - [Divide Array is Sets of K Consecutive Numbers](Medium/DivideArrayInKConsecNums)
 - Hard
  - [Maximum Score Words Formed by Letters](Hard/MaximumScoreWords)
  - [Reducing Dishes](Hard/ReducingDishes)