CodingMediumcod-g753

Subject KnapsackLevel Mid–Senior~25 minCommon in Distributed systems interviewsIndustries Software development

Question

Given an array of positive integers, determine whether it can be partitioned into two subsets with equal sum. Return true if such a partition exists, otherwise false. Constraints: 1 <= n <= 200, 1 <= nums[i] <= 100.

Implement

can_partition(nums: list[int]) → bool

Examples

in[[1,5,11,5]]outtrue

What 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.

Learn the concepts

Vibe coding: describe the solution in plain language (or narrate it) and the coach grades your approach. Generating runnable code from your description is coming next.

Run or narrate your approach, then ask the coach.