You are given an integer array ranks and a character array suits. There are $5$ cards where the $i^{ ext{th}}$ card has a rank of ranks[i] and a suit of suits[i].

Return a string representing the highest ranking poker hand that can be formed from the given cards.

The possible poker hands, ordered from best to worst, are:

$1$. "Flush": $5$ cards of the exact same suit.
$2$. "Three of a Kind": $3$ cards of the exact same rank.
$3$. "Pair": $2$ cards of the exact same rank.
$4$. "High Card": Any single card that does not meet the criteria of the hands above.

Note: The returned hand must be the highest ranking hand among all valid hands that can be formed.

Constraints:

• ranks.length $==$ suits.length $== 5$

• $1 \leq$ ranks[i] $\leq 13$

• 'a' $\leq$ suits[i] $\leq$ 'd'

• No two cards have the same rank and suit.

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.