Add solution #1704

JoshCrozier · JoshCrozier · commit 29b7fe01e015 · 2025-04-26T19:15:12.000-05:00
diff --git a/README.md b/README.md
@@ -1,4 +1,4 @@
-# 1,488 LeetCode solutions in JavaScript
+# 1,489 LeetCode solutions in JavaScript
 
 [https://leetcodejavascript.com](https://leetcodejavascript.com)
 
@@ -1313,6 +1313,7 @@
 1701|[Average Waiting Time](./solutions/1701-average-waiting-time.js)|Medium|
 1702|[Maximum Binary String After Change](./solutions/1702-maximum-binary-string-after-change.js)|Medium|
 1703|[Minimum Adjacent Swaps for K Consecutive Ones](./solutions/1703-minimum-adjacent-swaps-for-k-consecutive-ones.js)|Hard|
+1704|[Determine if String Halves Are Alike](./solutions/1704-determine-if-string-halves-are-alike.js)|Easy|
 1716|[Calculate Money in Leetcode Bank](./solutions/1716-calculate-money-in-leetcode-bank.js)|Easy|
 1718|[Construct the Lexicographically Largest Valid Sequence](./solutions/1718-construct-the-lexicographically-largest-valid-sequence.js)|Medium|
 1726|[Tuple with Same Product](./solutions/1726-tuple-with-same-product.js)|Medium|
diff --git a/solutions/1704-determine-if-string-halves-are-alike.js b/solutions/1704-determine-if-string-halves-are-alike.js
@@ -0,0 +1,31 @@
+/**
+ * 1704. Determine if String Halves Are Alike
+ * https://leetcode.com/problems/determine-if-string-halves-are-alike/
+ * Difficulty: Easy
+ *
+ * You are given a string s of even length. Split this string into two halves of equal lengths,
+ * and let a be the first half and b be the second half.
+ *
+ * Two strings are alike if they have the same number of vowels ('a', 'e', 'i', 'o', 'u', 'A',
+ * 'E', 'I', 'O', 'U'). Notice that s contains uppercase and lowercase letters.
+ *
+ * Return true if a and b are alike. Otherwise, return false.
+ */
+
+/**
+ * @param {string} s
+ * @return {boolean}
+ */
+var halvesAreAlike = function(s) {
+  const vowels = new Set(['a', 'e', 'i', 'o', 'u', 'A', 'E', 'I', 'O', 'U']);
+  let firstHalfVowels = 0;
+  let secondHalfVowels = 0;
+  const mid = s.length / 2;
+
+  for (let i = 0; i < mid; i++) {
+    if (vowels.has(s[i])) firstHalfVowels++;
+    if (vowels.has(s[i + mid])) secondHalfVowels++;
+  }
+
+  return firstHalfVowels === secondHalfVowels;
+};
