Given a distinct set of integers, return all possible subsets.

Question

Talya Baris · Accepted Answer

public static void subset(int[] disntictSet){
	  if(disntictSet==null || disntictSet.length==0){
		  return;
	  }
	  int N=disntictSet.length;
	  int allMasks = (1  0) //The j-th element is used
	             System.out.print((j + 1) + " ");
	      }
	      System.out.println();
	  }
  }

Solution in Swift · Answer

func Subsets(s: [Int])-> [[Int]] {
  
  var sortedSet = s
  sortedSet.quickSort()
  
  var result = [[Int]]()
  
  for item: Int in sortedSet {
    
    var temp = [[Int]]()
    
    for subset in result {
      temp.append(subset + [item])
    }
  
    temp.append([item])
    
    result += temp
  }
  
  result.append([Int]())
  
  return result
}

Meta

Meta Interview Question

Interview Answers

Want the inside scoop on your own company?

Bowls

Followed companies

Job searches