rohan-paul
diff --git a/‎ReadMe.md
100644100755 b/‎ReadMe.md
100644100755
diff --git a/‎package-lock.json
100644100755 b/‎package-lock.json
100644100755
diff --git a/‎package.json
100644100755 b/‎package.json
100644100755
diff --git a/‎solutions/1.2-if-two-strings-are-permutations.js
100644100755
Lines changed: 2 additions & 1 deletion b/‎solutions/1.2-if-two-strings-are-permutations.js
100644100755
Lines changed: 2 additions & 1 deletion
diff --git a/‎test/1.1.spec.js
100644100755 b/‎test/1.1.spec.js
100644100755
diff --git a/‎test/1.2.spec.js
100644100755 b/‎test/1.2.spec.js
100644100755
@@ -19,7 +19,8 @@ D> With the for loop, for each character in str1, I am setting its "UTF-16 code
 
 E> Compare the occurrence of each character, using the char value as index into an array of counts.
 
-Time Complexity: O(n) . */
+Time Complexity: O(n) .  Space Complexity: O(1) given - 2**16 ints
+*/
 
 function isPermutation(str1, str2) {
   if (str1.length !== str2.length) {