Dsa
Backtracking
Medium
Partition Equal Subset Sum
Given a list of integers, your goal is to determine whether it is possible to partition the list into two subsets such that the sum of elements in both subsets is equal. Write a program to return all unique combinations that can form such partitions.
Example:
Input:
1 5 11 5
Output:
1 5 5 and 11
Key concepts
backtrackingsubsetsintegers
Practise this out loud — free
Start a mock interview on THIS exact question — a voice AI interviewer opens with it, pushes back like a real onsite, then hands you an instant scorecard.
🎙 Practise this question now