Add 2024

Author: trung-hn

Readme.md

@@ -611,6 +611,7 @@
 | 1971 | [Find if Path Exists in Graph](src/1971.find-if-path-exists-in-graph.py) | Easy | O(N) | O(N) | BFS, DFS, Graph | | |
 | 1974 | [Minimum Time to Type Word Using Special Typewriter](src/1974.minimum-time-to-type-word-using-special-typewriter.py) | Easy | O(N) | O(1) | String, Greedy | | |
 | 2000 | [Reverse Prefix of Word](src/2000.reverse-prefix-of-word.py) | Easy | O(N) | O(1) | Two Pointers, String | | |
+| 2024 | [Maximize the Confusion of an Exam](src/2024.maximize-the-confusion-of-an-exam.py) | Medium | O(N) | O(1) | String, Binary Search, Sliding Window, Prefix Sum | | |
 | 2039 | [The Time When the Network Becomes Idle](src/2039.the-time-when-the-network-becomes-idle.py) | Medium | O(V+E) | O(V+E) | Array, BFS, Graph | | |
 | 2042 | [Check if Numbers Are Ascending in a Sentence](src/2042.check-if-numbers-are-ascending-in-a-sentence.py) | Easy | O(N) | O(1) | String | | |
 | 2062 | [Count Vowel Substrings of a String](src/2062.count-vowel-substrings-of-a-string.py) | Easy | O(N^3) | O(N) | Hash Table, String | | |

src/2024.maximize-the-confusion-of-an-exam.py

@@ -0,0 +1,24 @@
+#
+# @lc app=leetcode id=2024 lang=python3
+#
+# [2024] Maximize the Confusion of an Exam
+#
+
+# @lc code=start
+# TAGS: String, Binary Search, Sliding Window, Prefix Sum
+class Solution:
+    # 472 ms, 51.69%. Time and Space: O(N)
+    def maxConsecutiveAnswers(self, answerKey: str, k: int) -> int:
+        def get_optimal(answerKey, k, neg="F"):
+            ans = ptr = 0
+            for i, c in enumerate(answerKey):
+                if c == neg:
+                    while not k:
+                        k += answerKey[ptr] == neg
+                        ptr += 1
+                    k -= 1
+                ans = max(ans, i + 1 - ptr)
+            return ans
+
+        return max(get_optimal(answerKey, k, neg="F"), get_optimal(answerKey, k, neg="T"))
+# @lc code=end