Partition into k equal subsets
Given an integer list nums and an integer k, return True if nums can be partitioned into exactly k non-empty subsets all having equal sum. 1 <= k <= len(nums) <= 12, values are positive. Return a boolean.
Implement
can_partition_k_subsets(nums: list[int], k: int) → boolExamples
in
[[4,3,2,3,5,2,1],4]outtrueWhat a strong answer looks like
State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.
0:00 of about 30 min
solution.py
InputExpectedGot
[[4,3,2,3,5,2,1],4]truenot run yetsample