Fixed description

Author: ignacio-chiazzo

LeetcodeProblems/Maximun_Subarray.js

@@ -1,6 +1,6 @@
 /*
 Maximum Subarray
-https://leetcode.com/problems/maximum-subarray/submissions/1
+https://leetcode.com/problems/maximum-subarray
 
 Given an integer array nums, find the contiguous subarray (containing at least one number) 
 which has the largest sum and return its sum.

LeetcodeProblems/Permutations_Without_Duplicates.js

@@ -1,4 +1,22 @@
-//https://leetcode.com/problems/permutations/description/
+/*
+Permutations withuot duplicates
+https://leetcode.com/problems/permutations/description/
+
+Given a collection of distinct integers, return all possible permutations.
+
+Example:
+
+Input: [1,2,3]
+Output:
+[
+  [1,2,3],
+  [1,3,2],
+  [2,1,3],
+  [2,3,1],
+  [3,1,2],
+  [3,2,1]
+]
+*/
 
 // Permutations wihto
 var subsetWithDuplicates = function(nums) {

LeetcodeProblems/Subsets.js

@@ -1,3 +1,28 @@
+/*
+Subsets 
+https://leetcode.com/problems/subsets/description/
+
+Given a set of distinct integers, nums, return all possible subsets (the power set).
+
+Note: The solution set must not contain duplicate subsets.
+
+Example:
+
+Input: nums = [1,2,3]
+Output:
+[
+  [3],
+  [1],
+  [2],
+  [1,2,3],
+  [1,3],
+  [2,3],
+  [1,2],
+  []
+]
+*/
+
+
 var subsets = function(nums) {
   var ret = [];