Add solution #1614

Author: JoshCrozier

README.md

@@ -1,4 +1,4 @@
-# 1,420 LeetCode solutions in JavaScript
+# 1,421 LeetCode solutions in JavaScript
 
 [https://leetcodejavascript.com](https://leetcodejavascript.com)
 
@@ -1244,6 +1244,7 @@
 1609|[Even Odd Tree](./solutions/1609-even-odd-tree.js)|Medium|
 1610|[Maximum Number of Visible Points](./solutions/1610-maximum-number-of-visible-points.js)|Hard|
 1611|[Minimum One Bit Operations to Make Integers Zero](./solutions/1611-minimum-one-bit-operations-to-make-integers-zero.js)|Hard|
+1614|[Maximum Nesting Depth of the Parentheses](./solutions/1614-maximum-nesting-depth-of-the-parentheses.js)|Easy|
 1657|[Determine if Two Strings Are Close](./solutions/1657-determine-if-two-strings-are-close.js)|Medium|
 1668|[Maximum Repeating Substring](./solutions/1668-maximum-repeating-substring.js)|Easy|
 1669|[Merge In Between Linked Lists](./solutions/1669-merge-in-between-linked-lists.js)|Medium|

solutions/1614-maximum-nesting-depth-of-the-parentheses.js

@@ -0,0 +1,28 @@
+/**
+ * 1614. Maximum Nesting Depth of the Parentheses
+ * https://leetcode.com/problems/maximum-nesting-depth-of-the-parentheses/
+ * Difficulty: Easy
+ *
+ * Given a valid parentheses string s, return the nesting depth of s. The nesting depth is the
+ * maximum number of nested parentheses.
+ */
+
+/**
+ * @param {string} s
+ * @return {number}
+ */
+var maxDepth = function(s) {
+  let currentDepth = 0;
+  let maxDepth = 0;
+
+  for (const char of s) {
+    if (char === '(') {
+      currentDepth++;
+      maxDepth = Math.max(maxDepth, currentDepth);
+    } else if (char === ')') {
+      currentDepth--;
+    }
+  }
+
+  return maxDepth;
+};