Merge pull request #2521 from Cyjin-jani/main

[Cyjin-jani] WEEK 06 Solutions

Author: Cyjin-jani

container-with-most-water/Cyjin-jani.js

@@ -0,0 +1,22 @@
+// tc: O(n);
+// sc: O(1);
+const maxArea = function (height) {
+  let max = 0;
+  let leftIdx = 0;
+  let rightIdx = height.length - 1;
+
+  while (leftIdx < rightIdx) {
+    const width = rightIdx - leftIdx;
+    const minHeight = Math.min(height[leftIdx], height[rightIdx]);
+    const area = width * minHeight;
+    max = Math.max(max, area);
+
+    if (height[leftIdx] > height[rightIdx]) {
+      rightIdx -= 1;
+    } else {
+      leftIdx += 1;
+    }
+  }
+
+  return max;
+};

design-add-and-search-words-data-structure/Cyjin-jani.js

@@ -0,0 +1,47 @@
+var WordDictionary = function () {
+  this.dictionary = new Set();
+};
+
+/**
+ * @param {string} word
+ * @return {void}
+ */
+WordDictionary.prototype.addWord = function (word) {
+  this.dictionary.add(word);
+};
+
+/**
+ * @param {string} word
+ * @return {boolean}
+ */
+
+// tc:  O(n * k), n: dictionary size, k: word length => O(n) in worst case
+// sc: O(1)
+WordDictionary.prototype.search = function (word) {
+  if (!word.includes('.')) {
+    return this.dictionary.has(word);
+  }
+
+  for (const stored of this.dictionary) {
+    if (stored.length !== word.length) continue;
+
+    let isMatch = true;
+    for (let i = 0; i < word.length; i++) {
+      if (word[i] === '.') continue;
+      if (word[i] !== stored[i]) {
+        isMatch = false;
+        break;
+      }
+    }
+    if (isMatch) return true;
+  }
+
+  return false;
+};
+
+/**
+ * Your WordDictionary object will be instantiated and called as such:
+ * var obj = new WordDictionary()
+ * obj.addWord(word)
+ * var param_2 = obj.search(word)
+ */

valid-parentheses/Cyjin-jani.js

@@ -0,0 +1,34 @@
+// tc: O(n)
+// sc: O(n)
+const isValid = function (s) {
+  const bracketMap = {
+    '(': ')',
+    '{': '}',
+    '[': ']',
+  };
+
+  if (s.length % 2 !== 0 || isCloseBracket(s[0])) return false;
+
+  const stack = [];
+
+  for (let i = 0; i < s.length; i++) {
+    if (stack.length === 0) {
+      stack.push(s[i]);
+      continue;
+    }
+
+    let topBracket = stack.pop();
+    if (bracketMap[topBracket] !== s[i]) {
+      stack.push(topBracket);
+      stack.push(s[i]);
+    }
+  }
+
+  return stack.length === 0;
+};
+
+function isCloseBracket(char) {
+  const closeBrackets = [')', '}', ']'];
+
+  return closeBrackets.includes(char);
+}