fork(4) download 
  1. // your code goes here
  2. /*
  3. Given an integer array nums that may contain duplicates, return all possible subsets (the power set).
  4.  
  5. The solution set must not contain duplicate subsets. Return the solution in any order.
  6.  
  7.  
  8.  
  9. Example 1:
  10.  
  11. Input: nums = [1,2,2]
  12. Output: [[],[1],[1,2],[1,2,2],[2],[2,2]]
  13. Example 2:
  14.  
  15. Input: nums = [0]
  16. Output: [[],[0]]
  17. */
Success #stdin #stdout 0.04s 16500KB
comments (?)
stdin 
Standard input is empty
stdout 
Standard output is empty
https://ideone.com/NcZXOt
language:
JavaScript (SMonkey 60.2.3)
created:
6 days ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!