Minimum Rounds to Complete All Tasks LeetCode solution in Python

1
class Solution:
2
    def minimumRounds(self, tasks: List[int]) -> int:
3
        dic = {}
4
        c = 0
5
        for i in tasks:
6
            if i in dic.keys():
7
                dic[i] += 1
8
            else:
9
                dic[i] = 1
10
        for i in dic.keys():
11
            if dic[i] == 1:
12
                return -1
13
            while dic[i] >= 2:
14
                if dic[i] - 3 > 1:
15
                    dic[i] -= 3
16
                    c += 1
17
                else:
18
                    dic[i] -= 2
19
                    c += 1
20
        return c