If two players have the same ranked hands then the rank made up of the highest value wins for example, a pair of eights beats a pair of fives (see example 1 below).

Royal Flush: Ten, Jack, Queen, King, Ace, in same suit.Ģ, 3, 4, 5, 6, 7, 8, 9, 10, Jack, Queen, King, Ace.

Straight Flush: All cards are consecutive values of same suit.

Four of a Kind: Four cards of the same value.

Full House: Three of a kind and a pair.

Straight: All cards are consecutive values.

Three of a Kind: Three cards of the same value.

In the card game poker, a hand consists of five cards and are ranked, from lowest to highest, in the following way: The problem 54, porker hands looks a good candidate for this advanture. The code on this page was pulled from the repo and the solution and execution time were calculated based on that code.To see the real power of a functional langulage, I would apply it to a complicate problem. View AnswerĪll of our solutions are hosted on GitHub. Please consider reviewing the implementation and trying to code your own solution before viewing the answer. If you would like to view the answer, click below to reveal.

This implementation found the solution in 20ms. Our solution is given in the TypeScript code below: Results You can assume that all hands are valid (no invalid characters or repeated cards), each player's hand is in no specific order, and in each hand there is a clear winner. Each line of the file contains ten cards (separated by a single space): the first five are Player 1's cards and the last five are Player 2's cards. The file, poker.txt, contains one-thousand random hands dealt to two players. But if two ranks tie, for example, both players have a pair of queens, then highest cards in each hand are compared (see example 4 below) if the highest cards tie then the next highest cards are compared, and so on.Ĭonsider the following five hands dealt to two players:

Project euler 54