Time: 373 ms (99.23%), Space: 14.4 MB (59.79%) - LeetHub

Author: mrprashantkumar

0621-task-scheduler/0621-task-scheduler.py

@@ -0,0 +1,6 @@
+class Solution:
+    def leastInterval(self, tasks: List[str], n: int) -> int:
+        freq = Counter(tasks)
+        Most_freq = freq.most_common()[0][1]
+        Found_most = sum([freq[key] == Most_freq for key in freq])
+        return max(len(tasks), (Most_freq - 1) * (n + 1) + Found_most)