diff --git a/curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-260-stone-game.md b/curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-260-stone-game.md
index 6030adaf03..717d3bfcb3 100644
--- a/curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-260-stone-game.md
+++ b/curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-260-stone-game.md
@@ -10,7 +10,7 @@ dashedName: problem-260-stone-game
 
 A game is played with three piles of stones and two players.
 
-On each player's turn, the player removes one or more stones from the piles. However, if the player takes stones from more than one pile, the same number of stunes must be removed from each of the selected piles.
+On each player's turn, the player removes one or more stones from the piles. However, if the player takes stones from more than one pile, the same number of stones must be removed from each of the selected piles.
 
 In other words, the player chooses some $N > 0$ and removes: