From 80d8f889ba2c3bcdf9f019a6cfd1e5568c623dcc Mon Sep 17 00:00:00 2001
From: RiaOh <ken5840714@gmail.com>
Date: Mon, 5 May 2025 16:34:00 +0900
Subject: [PATCH 1/3] valid parentheses solution

---
 valid-parentheses/RiaOh.js | 28 ++++++++++++++++++++++++++++
 1 file changed, 28 insertions(+)
 create mode 100644 valid-parentheses/RiaOh.js

diff --git a/valid-parentheses/RiaOh.js b/valid-parentheses/RiaOh.js
new file mode 100644
index 000000000..6549c6c7d
--- /dev/null
+++ b/valid-parentheses/RiaOh.js
@@ -0,0 +1,28 @@
+/**
+ * @param {string} s
+ * @return {boolean}
+ */
+var isValid = function (s) {
+  const newArr = [...s];
+  if (newArr[0] === ")" || newArr[0] === "}" || newArr[0] === "]") {
+    return false;
+  }
+
+  for (let i = 1; i < newArr.length; i++) {
+    if (newArr[i] === ")" && newArr[i - 1] === "(") {
+      newArr.splice(i - 1, 2);
+      i = i - 2;
+    }
+
+    if (newArr[i] === "}" && newArr[i - 1] === "{") {
+      newArr.splice(i - 1, 2);
+      i = i - 2;
+    }
+
+    if (newArr[i] === "]" && newArr[i - 1] === "[") {
+      newArr.splice(i - 1, 2);
+      i = i - 2;
+    }
+  }
+  return newArr.length === 0 ? true : false;
+};

From 4a5bc50a0543003cff70cf443e793630207ceb8b Mon Sep 17 00:00:00 2001
From: RiaOh <ken5840714@gmail.com>
Date: Mon, 5 May 2025 16:42:02 +0900
Subject: [PATCH 2/3] best time to buy and sell stock solution

---
 best-time-to-buy-and-sell-stock/RiaOh.js | 15 +++++++++++++++
 1 file changed, 15 insertions(+)
 create mode 100644 best-time-to-buy-and-sell-stock/RiaOh.js

diff --git a/best-time-to-buy-and-sell-stock/RiaOh.js b/best-time-to-buy-and-sell-stock/RiaOh.js
new file mode 100644
index 000000000..74cff4c7e
--- /dev/null
+++ b/best-time-to-buy-and-sell-stock/RiaOh.js
@@ -0,0 +1,15 @@
+/**
+ * @param {number[]} prices
+ * @return {number}
+ */
+var maxProfit = function (prices) {
+  // 가장 작은 수
+  let minNum = prices[0];
+  // 차이 값
+  let maxProfit = 0;
+  for (let i = 1; i < prices.length; i++) {
+    minNum = Math.min(minNum, prices[i - 1]); // 이전꺼 중 가장 작은 수
+    maxProfit = Math.max(maxProfit, prices[i] - minNum);
+  }
+  return maxProfit;
+};

From 38a908f7acdfcca911423d5898dc57ee37497092 Mon Sep 17 00:00:00 2001
From: RiaOh <ken5840714@gmail.com>
Date: Wed, 7 May 2025 23:42:22 +0900
Subject: [PATCH 3/3] container with most water solution

---
 container-with-most-water/RiaOh.js | 24 ++++++++++++++++++++++++
 1 file changed, 24 insertions(+)
 create mode 100644 container-with-most-water/RiaOh.js

diff --git a/container-with-most-water/RiaOh.js b/container-with-most-water/RiaOh.js
new file mode 100644
index 000000000..9ab83a9f4
--- /dev/null
+++ b/container-with-most-water/RiaOh.js
@@ -0,0 +1,24 @@
+/**
+ * @param {number[]} height
+ * @return {number}
+ */
+const maxArea = function (height) {
+  let left = 0;
+  let right = height.length - 1;
+  let max = 0;
+
+  while (left < right) {
+    const graphW = right - left;
+    const grapghH = Math.min(height[left], height[right]);
+
+    max = Math.max(max, graphW * grapghH);
+
+    if (height[left] <= height[right]) {
+      left++;
+    } else {
+      right--;
+    }
+  }
+
+  return max;
+};