Skip to content
    SeaCode
    Learning tracksCode ArenaWorkshops & EventsInstructors
    Log inSign up
    Practice problems / Partition into equal sums

    Partition into equal sums

    Mediumdynamic programmingarray

    Return true if nums can be split into two groups with equal sums (each number in exactly one group).

    Example 1

    Input:  nums = [1,5,11,5]
    Output: true

    [1, 5, 5] and [11].

    Example 2

    Input:  nums = [1,2,3,5]
    Output: false

    Constraints

    • 1 ≤ nums.length ≤ 200
    • 1 ≤ nums[i] ≤ 100

    Submit checks your solution against 10 tests, including hidden ones.

    /**
     * @param {int[]} nums
     * @return {bool}
     */
    function canPartition(nums) {
      
    }
    
    Sign in to run
    SeaCode

    Learn to code for real, online or at our branch in front of Cairo University, Giza.

    Learn

    • All courses
    • Interactive tutorials
    • Interview practice problems
    • Mock interview
    • Learning tracks
    • Code Arena
    • Workshops & Events
    • Knowledge library
    • Team projects

    Your account

    • Log in
    • Sign up
    • Learning plan
    • Certificates
    • Site map

    Contact us

    • WhatsApp
    • 010 9094 1104
    • In front of Cairo University, Giza

    © 2026 SeaCode. All rights reserved.