Skip to content
    SeaCode
    Learning tracksCode ArenaWorkshops & EventsInstructors
    Log inSign up
    Practice problems / All subsets

    All subsets

    Mediumbacktrackingrecursionbit manipulation

    nums has distinct values. Return every possible subset (including the empty and the full one). Order doesn't matter.

    Example 1

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

    Example 2

    Input:  nums = [0]
    Output: [[],[0]]

    Constraints

    • 0 ≤ nums.length ≤ 10
    • Values are distinct

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

    /**
     * @param {int[]} nums
     * @return {int[][]}
     */
    function subsets(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.