diff --git a/curriculum/challenges/english/blocks/daily-coding-challenges-javascript/68c1a929005bf54d342aa8d5.md b/curriculum/challenges/english/blocks/daily-coding-challenges-javascript/68c1a929005bf54d342aa8d5.md
index 442b0eecda3..a1b6d1d631a 100644
--- a/curriculum/challenges/english/blocks/daily-coding-challenges-javascript/68c1a929005bf54d342aa8d5.md
+++ b/curriculum/challenges/english/blocks/daily-coding-challenges-javascript/68c1a929005bf54d342aa8d5.md
@@ -14,7 +14,7 @@ In day four of Space Week, you are given a matrix of numbers (an array of arrays
 - Any number other than `0` is too dangerous to land. The higher the number, the more dangerous.
 - The safest spot is defined as the `0` cell whose surrounding cells (up to 4 neighbors, ignore diagonals) have the lowest total danger.
 - Ignore out-of-bounds neighbors (corners and edges just have fewer neighbors).
-- Return the indicies of the safest landing spot. There will always only be one safest spot.
+- Return the indices of the safest landing spot. There will always only be one safest spot.
 
 For instance, given:
 
@@ -25,7 +25,7 @@ For instance, given:
 ]
 ```
 
-Return `[0, 1]`, the indicies for the `0` in the first array.
+Return `[0, 1]`, the indices for the `0` in the first array.
 
 # --hints--
 
diff --git a/curriculum/challenges/english/blocks/daily-coding-challenges-python/68c1a929005bf54d342aa8d5.md b/curriculum/challenges/english/blocks/daily-coding-challenges-python/68c1a929005bf54d342aa8d5.md
index 3824ba74064..62e45dc78f8 100644
--- a/curriculum/challenges/english/blocks/daily-coding-challenges-python/68c1a929005bf54d342aa8d5.md
+++ b/curriculum/challenges/english/blocks/daily-coding-challenges-python/68c1a929005bf54d342aa8d5.md
@@ -14,7 +14,7 @@ In day four of Space Week, you are given a matrix of numbers (an array of arrays
 - Any number other than `0` is too dangerous to land. The higher the number, the more dangerous.
 - The safest spot is defined as the `0` cell whose surrounding cells (up to 4 neighbors, ignore diagonals) have the lowest total danger.
 - Ignore out-of-bounds neighbors (corners and edges just have fewer neighbors).
-- Return the indicies of the safest landing spot. There will always only be one safest spot.
+- Return the indices of the safest landing spot. There will always only be one safest spot.
 
 For instance, given:
 
@@ -25,7 +25,7 @@ For instance, given:
 ]
 ```
 
-Return `[0, 1]`, the indicies for the `0` in the first array.
+Return `[0, 1]`, the indices for the `0` in the first array.
 
 # --hints--