Back to Questions

Partition Equal Subset Sum

134.1K views•Asked at Stripe•
Medium

Question Explain

Given a non-empty array `nums` containing only positive integers, find if the array can be partitioned into two subsets such that the sum of elements in both subsets is equal. This is a 0/1 Knapsack problem variant.

Start Trying This Question Simulation

Practice answering orally or with text to get instant AI feedback.

Practice with This Question

Other interview questions like this

Two Sum

104.4K views

Longest Substring Without Repeating Characters

62.2K views

Median of Two Sorted Arrays

107.8K views
Partition Equal Subset Sum - Interview Question