96vksinghcort
diff --git a/‎71-80/77. Combinations.js
Copy file name to clipboard
+14Lines changed: 14 additions & 0 deletions b/‎71-80/77. Combinations.js
Copy file name to clipboard
+14Lines changed: 14 additions & 0 deletions
diff --git a/‎71-80/78. Subsets.js
Copy file name to clipboard
+13Lines changed: 13 additions & 0 deletions b/‎71-80/78. Subsets.js
Copy file name to clipboard
+13Lines changed: 13 additions & 0 deletions
diff --git a/‎71-80/79. Word Search.js
Copy file name to clipboard
+26Lines changed: 26 additions & 0 deletions b/‎71-80/79. Word Search.js
Copy file name to clipboard
+26Lines changed: 26 additions & 0 deletions
diff --git a/‎71-80/80. Remove Duplicates from Sorted Array II.js
Copy file name to clipboard
+18Lines changed: 18 additions & 0 deletions b/‎71-80/80. Remove Duplicates from Sorted Array II.js
Copy file name to clipboard
+18Lines changed: 18 additions & 0 deletions
@@ -0,0 +1,14 @@
+var combine = function(n, k) {
+  let result = []
+  let traverse = (arr, depth) =>{
+    if (arr.length === k) {
+      result.push(arr)
+      return
+    }
+    if (depth > n) {return}
+    traverse(arr, depth + 1)
+    traverse(arr.concat(depth), depth + 1)
+  }
+  traverse([], 1)
+  return result;
+};
@@ -0,0 +1,13 @@
+var subsets = function(nums) {
+    let ans = [[]]
+    let k = []
+    for(let i = 0 ; i < nums.length ; i++){
+        let n = ans.length
+        for(let j = 0 ; j < n ;j++){
+            k = Array.from(ans[j])
+            k.push(nums[i])
+            ans.push(k)
+        }
+    }
+    return ans
+};
@@ -0,0 +1,26 @@
+var exist = function(board, word) {
+     let found = false;
+  const backtrack = (board, rIdx, cIdx, word, letterIdx) => {
+    if(rIdx >= 0 && rIdx < board.length && cIdx >=0 && cIdx < board[0].length && board[rIdx][cIdx] === word[letterIdx]) {
+      if(letterIdx === word.length-1) found ||= true;
+      const curLetter = word[letterIdx];
+      board[rIdx][cIdx] = '';
+      backtrack(board, rIdx+1, cIdx, word, letterIdx+1);
+      backtrack(board, rIdx-1, cIdx, word, letterIdx+1);
+      backtrack(board, rIdx, cIdx+1, word, letterIdx+1);
+      backtrack(board, rIdx, cIdx-1, word, letterIdx+1);
+      board[rIdx][cIdx] = curLetter;
+    }
+  };
+
+  let letterIdx = 0;
+  board.forEach((row, rIdx) => {
+    row.forEach((cell, cIdx) => {
+      if(cell === word[letterIdx]) {
+        backtrack(board, rIdx, cIdx, word, letterIdx);
+        if(found) return found;
+      }
+    })
+  });  
+  return found;
+}
@@ -0,0 +1,18 @@
+var removeDuplicates = function(nums) {
+    let j = 0
+    let [m,c,k] = [0,0,0]
+    for(let i = 0 ; i <nums.length ;i++){
+        k = nums[i]
+        c = 0
+        while(nums[i] == k){
+            if(c < 2){
+                nums[j++] = k
+                c++
+                m++
+            }
+            i++
+        }
+        i--
+    }
+    nums.length = m
+};