Competitive ProgrammingEasy

Partition Problem

Detailed guide and Python implementation for the 'Partition Problem' problem.

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?
Consider using Dynamic Programming-specific data structures like sets or heaps.
Edge Cases to Watch
  • Empty input structures
  • Single element inputs
  • Large numerical bounds

Ready to Solve?

Open the problem in PyRun's browser-based Python editor. Your code runs fully offline — no server required.

Open in Editor

Recommended Python Resources

Expand your knowledge with related interactive tutorials, cheat sheets, and code comparisons.