From 0ae1df30c7d22cac8a8b7fc2e660882b3dcfabeb Mon Sep 17 00:00:00 2001 From: Adrian Muntean Date: Thu, 22 Oct 2020 21:59:49 +0300 Subject: [PATCH] fix: add info for problem 54 - project Euler (#40057) * fix: add info for problem 54 - project Euler * update text --- .../project-euler/problem-54-poker-hands.md | 2 ++ 1 file changed, 2 insertions(+) diff --git a/curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-54-poker-hands.md b/curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-54-poker-hands.md index fa96264ffb..52db5e1597 100644 --- a/curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-54-poker-hands.md +++ b/curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-54-poker-hands.md @@ -38,6 +38,8 @@ Consider the following five hands dealt to two players: |4|4D 6S 9H QH QC
Pair of Queens
Highest card Nine|3D 6D 7H QD QS
Pair of Queens
Highest card Seven|Player 1| |5|2H 2D 4C 4D 4S
Full House
with Three Fours|3C 3D 3S 9S 9D
Full House
with Three Threes|Player 1| +The global array (`handsArr`) passed to the function, contains one-thousand random hands dealt to two players. 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. 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. + How many hands does Player 1 win?