Back to Practice Dashboard
Competitive ProgrammingEasy
Partition Problem
Learn how to solve the 'Partition Problem' problem. This detailed resource details brute force and optimized approaches.
Problem Statement
Easy
Write a function can_partition_equal_sum(arr) that returns True if the array can be partitioned into two subsets such that the sum of elements in both subsets is equal, and False otherwise.
Constraints
- •1 <= len(arr) <= 100
- •1 <= arr[i] <= 100
Examples
Example 1
Input
can_partition_equal_sum([1, 5, 11, 5])
Output
True
Explanation
The array can be partitioned as {1, 5, 5} and {11}, which both sum to 11.
Example 2
Input
can_partition_equal_sum([1, 5, 3])
Output
False
Explanation
No equal sum partition is possible.
Need a Hint?
Define subproblem states, establish the recurrence relation, and use memoization (top-down) or tabulation (bottom-up).
Edge Cases to Watch
- Empty list or null input variables
- Single item lists/arrays
- Extremely large input bounds causing integer or stack overflow
Ready to Solve?
Open the problem in PyRun's browser-based Python editor. Your code runs fully offline — no server required.