jprdonnelly/freeCodeCamp
1
0
Fork 0
mirror of https://github.com/freeCodeCamp/freeCodeCamp.git synced 2026-05-08 00:00:41 -04:00
Code Issues Projects Releases Wiki Activity

fix(curriculum): typo in daily coding challenges py & js (#62301)

Browse Source
This commit is contained in:
Clarence Bakosi
2025-09-22 10:34:57 +01:00
committed by GitHub
parent 8f4fdeda58
commit 949ceff4e0
2 changed files with 4 additions and 4 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
curriculum/challenges/english/blocks/daily-coding-challenges-javascript/68c1a929005bf54d342aa8d5.md
View File

@@ -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--

4
curriculum/challenges/english/blocks/daily-coding-challenges-python/68c1a929005bf54d342aa8d5.md
View File

@@ -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--