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:
 |<strong>4</strong>|4D 6S 9H QH QC <br> Pair of Queens <br> Highest card Nine|3D 6D 7H QD QS <br> Pair of Queens <br> Highest card Seven|Player 1|
 |<strong>5</strong>|2H 2D 4C 4D 4S <br> Full House <br> with Three Fours|3C 3D 3S 9S 9D <br> Full House <br> 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?
 
 </section>