Best Poker Hand LeetCode solution in Python

1
# Runtime: 38 ms (Top 59.18%) | Memory: 13.9 MB (Top 14.06%)
2
class Solution:
3
    def bestHand(self, ranks: List[int], suits: List[str]) -> str:
4
        s = {}
5
        for i in suits:
6
            if i in s:
7
                s[i] += 1
8
                if s[i] == 5:
9
                    return "Flush"
10
            else:
11
                s[i] = 1
12
        r = {}
13
        max_ = 0
14
        for i in ranks:
15
            if i in r:
16
                r[i] += 1
17
                max_ = max(max_, r[i])
18
            else:
19
                r[i] = 1
20
        if max_ >= 3:
21
            return "Three of a Kind"
22
        elif max_ == 2:
23
            return "Pair"
24
        else:
25
            return "High Card"