Restyled by prettier

Author: restyled-commits

javascript/1-easy-two-sum.js

@@ -10,4 +10,4 @@ const twoSum = (nums, target) => {
   return result;
 };
 
-twoSum([ 2, 7, 11, 15 ], 9);
+twoSum([2, 7, 11, 15], 9);

javascript/11-container-with-most-water.js

@@ -2,7 +2,7 @@
  * @param {number[]} height
  * @return {number}
  */
-var maxArea = function(height) {
+var maxArea = function (height) {
   let left = 0;
   let right = height.length - 1;
   let maxArea = 0;
@@ -23,4 +23,4 @@ var maxArea = function(height) {
   }
 
   return maxArea;
-};
+};

javascript/125-validPalindrom.js

@@ -14,27 +14,24 @@
  * @param {string} s
  * @return {boolean}
  */
-var isPalindrome = function(s) {
+var isPalindrome = function (s) {
   let str = s.toLowerCase();
-  let finalStr = '';
+  let finalStr = "";
   for (let i = 0; i < str.length; i++) {
     const res = checkAsciiValue(str[i]);
     if (res === true) {
       finalStr += str[i];
     }
   }
-  if (finalStr === finalStr.split('').reverse().join(''))
-    return true;
+  if (finalStr === finalStr.split("").reverse().join("")) return true;
   return false;
 };
 
 const checkAsciiValue = (value) => {
-  if (value.charCodeAt(0) >= 97 && value.charCodeAt(0) <= 122)
-    return true;
-  if (value.charCodeAt(0) >= 48 && value.charCodeAt(0) <= 57)
-    return true;
+  if (value.charCodeAt(0) >= 97 && value.charCodeAt(0) <= 122) return true;
+  if (value.charCodeAt(0) >= 48 && value.charCodeAt(0) <= 57) return true;
   return false;
 };
 
-console.log(isPalindrome('A man, a plan, a canal: Panama'));
+console.log(isPalindrome("A man, a plan, a canal: Panama"));
 // console.log(isPalindrome('0p'));

javascript/13-easy-romatToInt.js

@@ -1,12 +1,12 @@
 const romanToInt = (s) => {
   const roman = {
-    I : 1,
-    V : 5,
-    X : 10,
-    L : 50,
-    C : 100,
-    D : 500,
-    M : 1000,
+    I: 1,
+    V: 5,
+    X: 10,
+    L: 50,
+    C: 100,
+    D: 500,
+    M: 1000,
   };
   let sum = 0;
   for (let i = 0; i < s.length; i++) {
@@ -20,4 +20,4 @@ const romanToInt = (s) => {
   return sum;
 };
 
-console.log(romanToInt('MCMXCIV'));
+console.log(romanToInt("MCMXCIV"));

javascript/136-singleNumber.js

@@ -2,7 +2,7 @@
  * @param {number[]} nums
  * @return {number}
  */
-var singleNumber = function(nums) {
+var singleNumber = function (nums) {
   let length = nums.length;
   let uniqueVal;
   for (let i = 0; i < length; i++) {
@@ -16,4 +16,4 @@ var singleNumber = function(nums) {
   return uniqueVal;
 };
 
-console.log(singleNumber([ 4, 1, 2, 1, 2 ]));
+console.log(singleNumber([4, 1, 2, 1, 2]));

javascript/14-easy-longestCommonPrefix.js

@@ -1,15 +1,13 @@
 const longestCommonPrefix = (strs) => {
-  if (strs.length === 0)
-    return '';
-  let result = '';
+  if (strs.length === 0) return "";
+  let result = "";
   for (let i = 0; i < strs[0].length; i++) {
     for (let j = 1; j < strs.length; j++) {
-      if (strs[j][i] !== strs[0][i])
-        return result;
+      if (strs[j][i] !== strs[0][i]) return result;
     }
     result += strs[0][i];
   }
   return result;
 };
 
-console.log(longestCommonPrefix([ 'flower', 'flow', 'flight' ]));
+console.log(longestCommonPrefix(["flower", "flow", "flight"]));

javascript/20-easy-validParenthesis.js

@@ -1,18 +1,17 @@
 const isValid = (str) => {
-  if (str.length % 2 !== 0)
-    return false;
+  if (str.length % 2 !== 0) return false;
   const stack = [];
   const map = {
-    '(' : ')',
-    '[' : ']',
-    '{' : '}',
+    "(": ")",
+    "[": "]",
+    "{": "}",
   };
   for (let i = 0; i < str.length; i++) {
-    if (str[i] === '(' || str[i] === '[' || str[i] === '{') {
+    if (str[i] === "(" || str[i] === "[" || str[i] === "{") {
       stack.push(str[i]);
     } else {
       const last = stack.pop();
-      console.log('last', last + ' ' + i);
+      console.log("last", last + " " + i);
       if (str[i] !== map[last]) {
         return false;
       }
@@ -24,4 +23,4 @@ const isValid = (str) => {
   return true;
 };
 
-console.log(isValid('()[]{}'));
+console.log(isValid("()[]{}"));

javascript/205-isomorphicCharacter.js

@@ -1,5 +1,4 @@
-
-var isIsomorphic = function(s, t) {
+var isIsomorphic = function (s, t) {
   let map = new Map();
   let map2 = new Map();
   for (let i = 0; i < s.length; i++) {
@@ -15,6 +14,6 @@ var isIsomorphic = function(s, t) {
   return true;
 };
 
-console.log(isIsomorphic('egg', 'add'));
+console.log(isIsomorphic("egg", "add"));
 // console.log(isIsomorphic('ffo', 'bar'));
 // console.log(isIsomorphic('paper', 'title'));

javascript/21-easy-mergeTwoSortedList.js

@@ -1,8 +1,6 @@
 const mergeTwoLists = (l1, l2) => {
-  if (!l1)
-    return l2;
-  if (!l2)
-    return l1;
+  if (!l1) return l2;
+  if (!l2) return l1;
   if (l1.val < l2.val) {
     l1.next = mergeTwoLists(l1.next, l2);
     return l1;
@@ -11,4 +9,4 @@ const mergeTwoLists = (l1, l2) => {
   return l2;
 };
 
-console.log(mergeTwoLists([ 1, 2, 4 ], [ 1, 3, 4 ]));
+console.log(mergeTwoLists([1, 2, 4], [1, 3, 4]));

javascript/217-containsDuplicate.js

@@ -22,9 +22,9 @@
  * @param {number[]} nums
  * @return {boolean}
  */
-var containsDuplicate = function(nums) {
+var containsDuplicate = function (nums) {
   let unique = new Set(nums);
   return unique.size !== nums.length;
 };
 
-console.log(containsDuplicate([ 1, 2, 3, 4 ]));
+console.log(containsDuplicate([1, 2, 3, 4]));

javascript/26-easy-removeDuplicates.js

@@ -1,5 +1,4 @@
-
-var removeDuplicates = function(nums) {
+var removeDuplicates = function (nums) {
   let i = 0;
   while (i < nums.length) {
     if (nums[i] === nums[i + 1]) {
@@ -10,4 +9,4 @@ var removeDuplicates = function(nums) {
   }
   return nums.length;
 };
-console.log(removeDuplicates([ 0, 0, 1, 1, 1, 1, 2, 2, 3, 3, 3, 4 ]));
+console.log(removeDuplicates([0, 0, 1, 1, 1, 1, 2, 2, 3, 3, 3, 4]));

javascript/260-singleNumber2.js

@@ -2,7 +2,7 @@
  * @param {number[]} nums
  * @return {number}
  */
-var singleNumber = function(nums) {
+var singleNumber = function (nums) {
   let length = nums.length;
   let uniqueVal = [];
   for (let i = 0; i < length; i++) {
@@ -15,4 +15,4 @@ var singleNumber = function(nums) {
   return uniqueVal;
 };
 
-console.log(singleNumber([ 1, 2, 1, 3, 2, 5 ]));
+console.log(singleNumber([1, 2, 1, 3, 2, 5]));

javascript/2620-counter.js

@@ -2,7 +2,7 @@
  * @param {number} n
  * @return {Function} counter
  */
-var createCounter = function(n) {
+var createCounter = function (n) {
   let count = n;
 
   function counter() {

javascript/2667.js

@@ -1,5 +1,8 @@
 /**
  * @return {Function}
  */
-var createHelloWorld =
-    function() { return function(...args) { return 'Hello World'; }; };
+var createHelloWorld = function () {
+  return function (...args) {
+    return "Hello World";
+  };
+};

javascript/27-easy-removeElement.js

@@ -1,4 +1,4 @@
-var removeElement = function(nums, val) {
+var removeElement = function (nums, val) {
   for (let i = 0; i < nums.length; i++) {
     if (nums[i] === val) {
       nums.splice(i, 1);

javascript/2704-to-be-or-not-be.js

@@ -2,17 +2,15 @@
  * @param {string} val
  * @return {Object}
  */
-var expect = function(val) {
+var expect = function (val) {
   return {
-    toBe : function(expected) {
-      if (val === expected)
-        return true;
-      throw new Error('Not Equal');
+    toBe: function (expected) {
+      if (val === expected) return true;
+      throw new Error("Not Equal");
     },
-    notToBe : function(expected) {
-      if (val !== expected)
-        return true;
-      throw new Error('Equal');
+    notToBe: function (expected) {
+      if (val !== expected) return true;
+      throw new Error("Equal");
     },
   };
 };

javascript/344-reverseString.js

@@ -2,7 +2,7 @@
  * @param {character[]} s
  * @return {void} Do not return anything, modify s in-place instead.
  */
-var reverseString = function(s) {
+var reverseString = function (s) {
   let left = 0;
   let right = s.length - 1;
   while (left < right) {
@@ -16,4 +16,4 @@ var reverseString = function(s) {
   return s;
 };
 
-console.log(reverseString([ "h", "e", "l", "l", "o" ]));
+console.log(reverseString(["h", "e", "l", "l", "o"]));

javascript/35-easy-searchInsertPosition.js

@@ -13,4 +13,4 @@ const searchInsert = (nums, target) => {
   }
 };
 
-console.log(searchInsert([ 1, 3, 5, 6 ], 7)); // 2
+console.log(searchInsert([1, 3, 5, 6], 7)); // 2

javascript/3_longest_substring.js

@@ -7,15 +7,14 @@
  * @param {string} s
  * @return {number}
  */
-var lengthOfLongestSubstring = function(s) {
+var lengthOfLongestSubstring = function (s) {
   let longest = 0;
   let seen = {};
   let start = 0;
 
   for (let i = 0; i < s.length; i++) {
     let char = s[i];
-    if (seen[char])
-      start = Math.max(start, seen[char]);
+    if (seen[char]) start = Math.max(start, seen[char]);
 
     longest = Math.max(longest, i - start + 1);
     seen[char] = i + 1;
@@ -24,4 +23,4 @@ var lengthOfLongestSubstring = function(s) {
   return longest;
 };
 
-lengthOfLongestSubstring('abcabcbb');
+lengthOfLongestSubstring("abcabcbb");

javascript/4-findMedianSortedArrays.js

@@ -3,12 +3,12 @@
  * @param {number[]} nums2
  * @return {number}
  */
-var findMedianSortedArrays = function(nums1, nums2) {
+var findMedianSortedArrays = function (nums1, nums2) {
   let nums = nums1.concat(nums2);
   nums.sort((a, b) => a - b);
   let len = nums.length;
   let mid = Math.floor(len / 2);
   return len % 2 === 0 ? (nums[mid] + nums[mid - 1]) / 2 : nums[mid];
 };
 
-findMedianSortedArrays([ 1, 2 ], [ 3, 4 ]);
+findMedianSortedArrays([1, 2], [3, 4]);

javascript/58-easy-lengthOfLastWord.js

@@ -1,5 +1,5 @@
 const lengthOfLastWord = (str) => {
-  let strArr = str.trim().split(' ');
+  let strArr = str.trim().split(" ");
   const lws = strArr[strArr.length - 1];
   return lws.length;
 };

javascript/66-easy-plusOne.js

@@ -11,4 +11,4 @@ const plusOne = (digits) => {
   return digits;
 };
 
-plusOne([ 9, 9 ]);
+plusOne([9, 9]);

javascript/67-addBinary.js

@@ -1,8 +1,9 @@
 const addBinary = (a, b) => {
-  let sum = '', carry = 0;
+  let sum = "",
+    carry = 0;
 
-  a = a.split('');
-  b = b.split('');
+  a = a.split("");
+  b = b.split("");
   const len = Math.max(a.length, b.length);
   for (let i = 0; i < len; i++) {
     const x = parseInt(a.pop() || 0);
@@ -11,10 +12,9 @@ const addBinary = (a, b) => {
     sum = (temp % 2) + sum;
     carry = Math.floor(temp / 2);
   }
-  if (carry)
-    sum = carry + sum;
+  if (carry) sum = carry + sum;
 
   return sum;
 };
 
-console.log(addBinary('1010', '1011'));
+console.log(addBinary("1010", "1011"));

javascript/69-Sqrt.js

@@ -6,7 +6,7 @@
 //   return Math.floor(Math.sqrt(x));
 // };
 
-var mySqrt = function(x) {
+var mySqrt = function (x) {
   let i = 1;
   let sqr = i * i;
 

javascript/88-margSortedArray.js

@@ -6,7 +6,7 @@ The result of the merge is [1,2,2,3,5,6] with the underlined elements coming
 from nums1.
 */
 
-var merge = function(nums1, m, nums2, n) {
+var merge = function (nums1, m, nums2, n) {
   var index = m + n - 1; // last index
   while (n > 0) {
     if (m > 0 && nums1[m - 1] > nums2[n - 1]) {
@@ -20,4 +20,4 @@ var merge = function(nums1, m, nums2, n) {
   }
 };
 
-console.log(merge([ 1, 2, 3, 0, 0, 0 ], 3, [ 2, 5, 6 ], 3));
+console.log(merge([1, 2, 3, 0, 0, 0], 3, [2, 5, 6], 3));