Best Poker Hand Problem

Best Poker Hand Problem — ExecCode Easy DSA Practice

Solve the Best Poker Hand problem on ExecCode. Free online easy DSA practice in Arrays - Logic Building. Write and run code in Java, C++, Python — no signup required to run.

Problem description

Description You are given an integer array ranks and a character array suits. Your task is to compute the required answer and return a string representing the best type of poker hand you can make with the given cards. You have 5 cards where the i^th card has a rank of ranks[i] and a suit of suits[i]. The following are the types of poker hands you can make from best to worst: 1. "Flush": Five cards of the same suit.

Examples

Input {"ranks": [13, 2, 3, 1, 9], "suits": ["a", "a", "a", "a", "a"]}; Output Flush. Input {"ranks": [4, 4, 2, 4, 4], "suits": ["d", "a", "a", "b", "c"]}; Output Three of a Kind

Constraints

ranks.length == suits.length == 5 1 <= ranks[i] <= 13 'a' <= suits[i] <= 'd' No two cards have the same rank and suit.

Practice Best Poker Hand free on ExecCode. Browse DSA problems, topic map, and placement guides.