Update dependencies

Author: web-flow

count-nice-pairs-in-an-array/index.ts

@@ -1,8 +1,7 @@
 function countNicePairs(nums: number[]): number {
-
-   const MOD = 1000000007;
+    const MOD = 1000000007;
     let res = 0;
-    const h = new Map<number,number>();
+    const h = new Map<number, number>();
     for (const i of nums) {
         let temp = i, j = 0;
         while (temp > 0) {
@@ -13,5 +12,5 @@ function countNicePairs(nums: number[]): number {
         h.set(i - j, (h.get(i - j) || 0) + 1);
     }
     return res;
-};
-export default countNicePairs
+}
+export default countNicePairs;

sentence-similarity-iii/index.ts

@@ -1,28 +1,24 @@
 function areSentencesSimilar(sentence1: string, sentence2: string): boolean {
-const words1=sentence1.split(" ")
-const words2=sentence2.split(" ")
-
-
-if(words1.length===words2.length)return sentence1===sentence2
-
-
-while(words1.length&&words2.length&&words1[words1.length-1]===words2[words2.length-1]){
-    words1.pop()
-    words2.pop()
-}
-
-while(words1.length&&words2.length&&words1[0]===words2[0]){
-    words1.shift()
-    words2.shift()
-}
-
-
-if(words1.length===0||words2.length==0)return true
+    const words1 = sentence1.split(" ");
+    const words2 = sentence2.split(" ");
 
+    if (words1.length === words2.length) return sentence1 === sentence2;
 
+    while (
+        words1.length && words2.length &&
+        words1[words1.length - 1] === words2[words2.length - 1]
+    ) {
+        words1.pop();
+        words2.pop();
+    }
 
+    while (words1.length && words2.length && words1[0] === words2[0]) {
+        words1.shift();
+        words2.shift();
+    }
 
+    if (words1.length === 0 || words2.length == 0) return true;
 
-return false
+    return false;
 }
-export default areSentencesSimilar
+export default areSentencesSimilar;