add 2024

fishercoder1534 · fishercoder1534 · commit 53cdf2d1c0e4 · 2021-10-06T20:23:11.000-07:00
diff --git a/README.md b/README.md
@@ -10,6 +10,7 @@ _If you like this project, please leave me a star._ &#9733;
 |-----|----------------|---------------|--------|-------------|-------------
 |2028|[Find Missing Observations](https://leetcode.com/problems/find-missing-observations/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2028.java) ||Medium||
 |2027|[Minimum Moves to Convert String](https://leetcode.com/problems/minimum-moves-to-convert-string/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2027.java) ||Easy||
+|2024|[Maximize the Confusion of an Exam](https://leetcode.com/problems/maximize-the-confusion-of-an-exam/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2024.java) ||Medium||
 |2023|[Number of Pairs of Strings With Concatenation Equal to Target](https://leetcode.com/problems/number-of-pairs-of-strings-with-concatenation-equal-to-target/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2023.java) ||Medium||
 |2022|[Convert 1D Array Into 2D Array](https://leetcode.com/problems/convert-1d-array-into-2d-array/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2022.java) ||Easy||
 |2018|[Check if Word Can Be Placed In Crossword](https://leetcode.com/problems/check-if-word-can-be-placed-in-crossword/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2018.java) ||Medium||
diff --git a/src/main/java/com/fishercoder/solutions/_2024.java b/src/main/java/com/fishercoder/solutions/_2024.java
@@ -0,0 +1,57 @@
+package com.fishercoder.solutions;
+
+public class _2024 {
+    public static class Solution1 {
+        public int maxConsecutiveAnswers(String answerKey, int k) {
+            int max;
+            //change T to F and count number of Fs
+            int right = 0;
+            int originalK = k;
+            while (k > 0 && right < answerKey.length()) {
+                if (answerKey.charAt(right) == 'T') {
+                    k--;
+                }
+                right++;
+            }
+            max = right;
+            int left = 0;
+            while (right < answerKey.length() && left < answerKey.length()) {
+                if (answerKey.charAt(right) == 'F') {
+                    right++;
+                    max = Math.max(max, right - left);
+                } else {
+                    while (left < right && answerKey.charAt(left) == 'F') {
+                        left++;
+                    }
+                    left++;
+                    right++;
+                }
+            }
+
+            //change F to T
+            right = 0;
+            k = originalK;
+            while (k > 0 && right < answerKey.length()) {
+                if (answerKey.charAt(right) == 'F') {
+                    k--;
+                }
+                right++;
+            }
+            max = Math.max(max, right);
+            left = 0;
+            while (right < answerKey.length() && left < answerKey.length()) {
+                if (answerKey.charAt(right) == 'T') {
+                    right++;
+                    max = Math.max(max, right - left);
+                } else {
+                    while (left < right && answerKey.charAt(left) == 'T') {
+                        left++;
+                    }
+                    left++;
+                    right++;
+                }
+            }
+            return max;
+        }
+    }
+}
diff --git a/src/test/java/com/fishercoder/_2024Test.java b/src/test/java/com/fishercoder/_2024Test.java
@@ -0,0 +1,42 @@
+package com.fishercoder;
+
+import com.fishercoder.solutions._2024;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import static org.junit.Assert.assertEquals;
+
+public class _2024Test {
+    private static _2024.Solution1 solution1;
+
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _2024.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        assertEquals(4, solution1.maxConsecutiveAnswers("TTFF", 2));
+    }
+
+    @Test
+    public void test2() {
+        assertEquals(3, solution1.maxConsecutiveAnswers("TFFT", 1));
+    }
+
+    @Test
+    public void test3() {
+        assertEquals(5, solution1.maxConsecutiveAnswers("TTFTTFTT", 1));
+    }
+
+    @Test
+    public void test4() {
+        assertEquals(1, solution1.maxConsecutiveAnswers("F", 1));
+    }
+
+    @Test
+    public void test5() {
+        assertEquals(8, solution1.maxConsecutiveAnswers("FFFTTFTTFT", 3));
+    }
+
+}
