Equal sum partition
Return whether an array of positive integers can be split into two subsets with equal sums.
Implement
can_partition(nums: list[int]) → boolExamples
in
[[1,5,11,5]]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 35 min
solution.py
InputExpectedGot
[[1,5,11,5]]truenot run yetsample