From 4bfe989324856a21883f2c839c0295f5485f205e Mon Sep 17 00:00:00 2001
From: Matt <54373384+matt-user@users.noreply.github.com>
Date: Thu, 9 Sep 2021 03:28:35 -0400
Subject: [PATCH] fix: typo in problem 260 (#43418)

---
 .../project-euler/problem-260-stone-game.md                     | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

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 6030adaf034..717d3bfcb38 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: