Merge pull request #2994 from coopers/0621

Update 0621-task-scheduler.py

Author: sujal-goswami

python/0621-task-scheduler.py

@@ -18,3 +18,14 @@ def leastInterval(self, tasks: List[str], n: int) -> int:
             if q and q[0][1] == time:
                 heapq.heappush(maxHeap, q.popleft()[0])
         return time
+
+
+# Greedy algorithm
+class Solution(object):
+    def leastInterval(self, tasks: List[str], n: int) -> int:
+        counter = collections.Counter(tasks)
+        max_count = max(counter.values())
+        min_time = (max_count - 1) * (n + 1) + \
+                    sum(map(lambda count: count == max_count, counter.values()))
+    
+        return max(min_time, len(tasks))