Added Permutations In String

Author: ignacio-chiazzo

LeetcodeProblems/Algorithms/Permutations_In_String.js

@@ -0,0 +1,76 @@
+/*
+Permutation in String
+https://leetcode.com/problems/permutation-in-string/
+
+Given two strings s1 and s2, return true if s2 contains a permutation of s1, or false otherwise.
+In other words, return true if one of s1's permutations is the substring of s2.
+
+Example 1:
+
+Input: s1 = "ab", s2 = "eidbaooo"
+Output: true
+Explanation: s2 contains one permutation of s1 ("ba").
+Example 2:
+
+Input: s1 = "ab", s2 = "eidboaoo"
+Output: false
+
+Constraints:
+1 <= s1.length, s2.length <= 104
+s1 and s2 consist of lowercase English letters.
+*/
+
+
+/**
+ * @param {string} s1
+ * @param {string} s2
+ * @return {boolean}
+ */
+ var checkInclusion = function(s1, s2) {
+  if(s1.length > s2.length) {
+      return false
+  }
+  
+  let start = 0;
+  let end = s1.length - 1;
+  let countLeft = s1.length;
+  let hashBuild = {};
+  
+  for(var i = 0; i < s1.length; i++) {
+      hashBuild[s1[i]] = (hashBuild[s1[i]] || 0) + 1;
+  }
+  
+  for(var j = start; j < end; j++) { // TODO: didn't count upper bound
+      if(hashBuild[s2[j]] !== undefined) {
+          hashBuild[s2[j]] = hashBuild[s2[j]] - 1;
+          if(hashBuild[s2[j]] >= 0) {
+              countLeft--;
+          }
+      }
+  }
+  
+  while(end < s2.length) {
+      if(hashBuild[s2[end]] !== undefined) {
+          hashBuild[s2[end]] = hashBuild[s2[end]] - 1;
+           if(hashBuild[s2[end]] >= 0) {
+              countLeft--;
+          }
+      }
+      
+      if(countLeft == 0) { return true }
+      
+      if(hashBuild[s2[start]] !== undefined) {
+          hashBuild[s2[start]] = hashBuild[s2[start]] + 1;
+           if(hashBuild[s2[start]] >= 1) {
+              countLeft++;
+          }
+      }
+      
+      start++;
+      end++;
+  }
+  
+  return false;
+};
+
+module.exports.checkInclusion = checkInclusion;

LeetcodeProblems/RESOURCES.md

@@ -1,2 +1,2 @@
-[Common Patters on Leetcode problems]https://iorilan.medium.com/after-solved-1000-medium-leetcode-found-these-patterns-sliding-window-2-pointer-string-18332ca4861
+[Common Patters on Leetcode problems](https://iorilan.medium.com/after-solved-1000-medium-leetcode-found-these-patterns-sliding-window-2-pointer-string-18332ca4861)
 

LeetcodeProblemsTests/Algorithms/Permutations_In_String_Test.js

@@ -0,0 +1,12 @@
+const assert = require('assert');
+const checkInclusion = require('../../LeetcodeProblems/Algorithms/Permutations_In_String').checkInclusion;
+
+function test() {
+  assert.equal(false, checkInclusion("abc", "ab"));
+  assert.equal(false, checkInclusion("aa", "aba"));
+  assert.equal(true, checkInclusion("ab", "eidbaooo"));
+  assert.equal(false, checkInclusion("ab", "eidboaoo"));
+}
+test();
+
+module.exports.test = test;

README.md

@@ -39,11 +39,12 @@ To run a specific problem in your console run  `node <problem_file_path>` (e.g.
 | [Longest Palindromic Substring ](/LeetcodeProblems/Algorithms/Longest_Palindromic_Substring.js)                 | Medium | https://leetcode.com/problems/longest-palindromic-substring/|
 | [Longest Substring Without Reapeating Characters](/LeetcodeProblems/Algorithms/Longest_Substring.js)            | Medium | https://leetcode.com/problems/longest-substring-without-repeating-characters|
 | [Max Area Of Island ](/LeetcodeProblems/Algorithms/Max_Area_Of_Island.js)                                       | Medium | https://leetcode.com/problems/max-area-of-island/ |
-| [Max Consecutive Ones III ](/LeetcodeProblems/Algorithms/Max_Consecutive_Ones_III.js)                                       | Medium | https://leetcode.com/problems/max-consecutive-ones-iii |
+| [Max Consecutive Ones III ](/LeetcodeProblems/Algorithms/Max_Consecutive_Ones_III.js)                           | Medium | https://leetcode.com/problems/max-consecutive-ones-iii |
 | [Maximal Square ](/LeetcodeProblems/Algorithms/Maximal_Square.js)                                               | Medium | https://leetcode.com/problems/maximal-square/ |
 | [Minimum Size Subarray](/LeetcodeProblems/Algorithms/Minimum_Size_Subarray.js)                                  | Medium | https://leetcode.com/problems/minimum-size-subarray-sum |
 | [Permutations ](/LeetcodeProblems/Algorithms/Permutations.js)                                                   | Medium | https://leetcode.com/problems/permutations/ |
 | [Permutations II ](/LeetcodeProblems/Algorithms/Permutations_II.js)                                             | Medium | https://leetcode.com/problems/permutations-ii/ |
+| [Permutation in String](/LeetcodeProblems/Algorithms/Permutations_In_String.js)                                 | Medium | https://leetcode.com/problems/permutation-in-string/ |
 | [Permutations Without Duplicates ](/LeetcodeProblems/Algorithms/Permutations_Without_Duplicates.js)             | Medium | https://leetcode.com/problems/permutations/ |
 | [Restore IP Addresses ](/LeetcodeProblems/Algorithms/Restore_IP_Addresses.js)                                   | Medium | https://leetcode.com/problems/restore-ip-addresses/ |
 | [SearchIng Rotated Sorted Array ](/LeetcodeProblems/Algorithms/SearchIng_Rotated_Sorted_Array.js)               | Medium | https://leetcode.com/problems/search-in-rotated-sorted-array/ |