# Partition array into k subarrays leetcode

花花酱 LeetCode 698. Partition to K Equal Sum Subsets. By zxi on July 14, 2018. Problem. Given an array of integers nums and a positive integer k, find whether it's possible to divide this array into knon-empty subsets whose sums are all equal. Example 1:

Find sum of array elements with some variable say "Sum" to keep a track of sub-array with sum 0. If Sum is found to be 0 it means possible sub-array is found from 0 to the current index. Check if Sum that is found from the above process, is present in our Map or not.For the recursive approach, refer to Partition of a set into K subsets with equal sum. The idea is to use mask to determine the current state. The current state will tell us about the subset already formed ( which numbers are already selected ). For example: arr [] = [2, 1, 4, 3, 5, 6, 2], mask = (1100101), which means that { 2, 1, 5, 2 } are ...

Find sum of array elements with some variable say "Sum" to keep a track of sub-array with sum 0. If Sum is found to be 0 it means possible sub-array is found from 0 to the current index. Check if Sum that is found from the above process, is present in our Map or not.