hurahhhh!

1 - Two Sum.py

@@ -15,3 +15,12 @@ def twoSum(self, nums, target):
                     return [numsDict[target-i][0],numsDict[i][0]]
                 elif len(numsDict[target-i]) > 1:
                     return numsDict[target-i]
+
+# simple & elegant
+class Solution(object):
+    def twoSum(self, nums, target):
+        for i in range(len(nums)):
+            for j in range(i+1,len(nums)):
+                if nums[i]+nums[j]==target:
+                    return [i,j]
+

90 - Subsets II.py

@@ -59,3 +59,14 @@ def subsetsWithDup(self, nums):
             i += dupes
         return pset
 
+# Solution 3 - MB-44
+class Solution(object):
+    def subsetsWithDup(self,nums):
+        subsets = [[]]
+        if len(nums) == 1:
+            subsets.append(nums[0])
+        else: 
+            for i in range(len(nums)-1):
+                for j in range(i,len(nums)):
+                    subsets.append(nums[i:j+1])
+        return subsets