Add solution #2024

Author: JoshCrozier

README.md

@@ -1,4 +1,4 @@
-# 1,693 LeetCode solutions in JavaScript
+# 1,694 LeetCode solutions in JavaScript
 
 [https://leetcodejavascript.com](https://leetcodejavascript.com)
 
@@ -1552,6 +1552,7 @@
 2019|[The Score of Students Solving Math Expression](./solutions/2019-the-score-of-students-solving-math-expression.js)|Hard|
 2022|[Convert 1D Array Into 2D Array](./solutions/2022-convert-1d-array-into-2d-array.js)|Easy|
 2023|[Number of Pairs of Strings With Concatenation Equal to Target](./solutions/2023-number-of-pairs-of-strings-with-concatenation-equal-to-target.js)|Medium|
+2024|[Maximize the Confusion of an Exam](./solutions/2024-maximize-the-confusion-of-an-exam.js)|Medium|
 2027|[Minimum Moves to Convert String](./solutions/2027-minimum-moves-to-convert-string.js)|Easy|
 2033|[Minimum Operations to Make a Uni-Value Grid](./solutions/2033-minimum-operations-to-make-a-uni-value-grid.js)|Medium|
 2037|[Minimum Number of Moves to Seat Everyone](./solutions/2037-minimum-number-of-moves-to-seat-everyone.js)|Easy|

solutions/2024-maximize-the-confusion-of-an-exam.js

@@ -0,0 +1,43 @@
+/**
+ * 2024. Maximize the Confusion of an Exam
+ * https://leetcode.com/problems/maximize-the-confusion-of-an-exam/
+ * Difficulty: Medium
+ *
+ * A teacher is writing a test with n true/false questions, with 'T' denoting true and 'F' denoting
+ * false. He wants to confuse the students by maximizing the number of consecutive questions with
+ * the same answer (multiple trues or multiple falses in a row).
+ *
+ * You are given a string answerKey, where answerKey[i] is the original answer to the ith question.
+ * In addition, you are given an integer k, the maximum number of times you may perform the
+ * following operation:
+ * - Change the answer key for any question to 'T' or 'F' (i.e., set answerKey[i] to 'T' or 'F').
+ *
+ * Return the maximum number of consecutive 'T's or 'F's in the answer key after performing the
+ * operation at most k times.
+ */
+
+/**
+ * @param {string} answerKey
+ * @param {number} k
+ * @return {number}
+ */
+var maxConsecutiveAnswers = function(answerKey, k) {
+  const flipsLeft = k;
+  const count = { T: 0, F: 0 };
+  let result = 0;
+  let left = 0;
+
+  for (let right = 0; right < answerKey.length; right++) {
+    count[answerKey[right]]++;
+    const maxCount = Math.max(count.T, count.F);
+
+    while (right - left + 1 - maxCount > flipsLeft) {
+      count[answerKey[left]]--;
+      left++;
+    }
+
+    result = Math.max(result, right - left + 1);
+  }
+
+  return result;
+};