Add solution #1156

Author: JoshCrozier

README.md

@@ -1,4 +1,4 @@
-# 1,156 LeetCode solutions in JavaScript
+# 1,157 LeetCode solutions in JavaScript
 
 [https://leetcodejavascript.com](https://leetcodejavascript.com)
 
@@ -904,6 +904,7 @@
 1147|[Longest Chunked Palindrome Decomposition](./solutions/1147-longest-chunked-palindrome-decomposition.js)|Hard|
 1154|[Day of the Year](./solutions/1154-day-of-the-year.js)|Easy|
 1155|[Number of Dice Rolls With Target Sum](./solutions/1155-number-of-dice-rolls-with-target-sum.js)|Medium|
+1156|[Swap For Longest Repeated Character Substring](./solutions/1156-swap-for-longest-repeated-character-substring.js)|Medium|
 1161|[Maximum Level Sum of a Binary Tree](./solutions/1161-maximum-level-sum-of-a-binary-tree.js)|Medium|
 1189|[Maximum Number of Balloons](./solutions/1189-maximum-number-of-balloons.js)|Easy|
 1200|[Minimum Absolute Difference](./solutions/1200-minimum-absolute-difference.js)|Easy|

solutions/1156-swap-for-longest-repeated-character-substring.js

@@ -0,0 +1,44 @@
+/**
+ * 1156. Swap For Longest Repeated Character Substring
+ * https://leetcode.com/problems/swap-for-longest-repeated-character-substring/
+ * Difficulty: Medium
+ *
+ * You are given a string text. You can swap two of the characters in the text.
+ *
+ * Return the length of the longest substring with repeated characters.
+ */
+
+/**
+ * @param {string} text
+ * @return {number}
+ */
+var maxRepOpt1 = function(text) {
+  const map = new Map();
+  for (const char of text) {
+    map.set(char, (map.get(char) || 0) + 1);
+  }
+
+  let result = 0;
+  for (let i = 0; i < text.length;) {
+    const currentChar = text[i];
+    const segmentStart = i;
+
+    while (i < text.length && text[i] === currentChar) i++;
+    const segmentLength = i - segmentStart;
+
+    const totalAvailable = map.get(currentChar);
+    if (i < text.length && segmentLength < totalAvailable) {
+      const nextStart = i + 1;
+      let nextLength = 0;
+      while (nextStart + nextLength < text.length && text[nextStart + nextLength] === currentChar) {
+        nextLength++;
+      }
+      result = Math.max(result, Math.min(segmentLength + nextLength + 1, totalAvailable));
+    }
+    result = Math.max(result, Math.min(
+      segmentLength + (totalAvailable > segmentLength ? 1 : 0), totalAvailable
+    ));
+  }
+
+  return result;
+};