Coding interview questionMedium
AmazonGoogle

Partition a Set into Two Equal-Sum Groups

Given a set of positive integers, determine whether it can be partitioned into two groups with equal sums.

1. Problem Statement

You are given a set of positive integers. Determine whether it can be partitioned into two subsets with equal sums.

2. Live Coding Format

Work in the provided coding workspace while explaining your decisions to the live interviewer. Validation may use inline tests, examples, comments, or a verbal walkthrough.

3. Key Focus Areas

  • 1
    Problem clarification and contract
  • 2
    Approach exploration and optimality
  • 3
    Think-aloud communication and pacing
  • 4
    Implementation correctness
  • 5
    Code quality and language fluency
  • 6
    Tests and dry run
  • 7
    Debugging and self-correction
  • 8
    Complexity analysis
  • 9
    Follow-up performance

4. What Strong Candidates Should Demonstrate

  • Clarify uniqueness, sign, and zero-value assumptions before coding.
  • Explain a brute-force baseline, identify the repeated work, and improve it so the running time no longer grows exponentially with the number of values.
  • Think aloud while implementing readable, correct code.
  • Validate with explicit expected outputs and a top-to-bottom dry run.
  • Analyze time and space complexity and handle a bounded follow-up modification.

Want interactive feedback?

Practice this problem in the live coding workspace while the interviewer probes your clarification, implementation, trade-offs, and validation.

Continue to Dashboard

Core Concepts

Hidden because they name the technique, which a real interviewer would not tell you.

Show core concepts
BacktrackingRecursionDynamic ProgrammingComplexity Analysis

Continue preparing

Build a complete software engineer mock interview plan

Related Coding / DSA

Count Connected Land Regions in a Grid

Given a 2D grid of land and water cells, count the number of distinct connected land regions, where cells are connected horizontally or vertically.

Related Coding / DSA

Longest Strictly Increasing Subsequence

Given a sequence of integers, find the length of the longest subsequence (not necessarily contiguous) whose elements are strictly increasing.