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

fix(curriculum): guaranteed typo in daily challenge (#66307)

Browse Source
This commit is contained in:
Supravisor
2026-03-10 18:25:51 +13:00
committed by GitHub
parent 96f80a6493
commit 5eea0731aa
2 changed files with 2 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
curriculum/challenges/english/blocks/daily-coding-challenges-javascript/698a1a73ade5ac0e19180fa8.md
View File

@@ -9,7 +9,7 @@ dashedName: challenge-205
Given two integers, determine how many perfect cubes exist in the range between and including the two numbers.
- The lower number is not garanteed to be the first argument.
- The lower number is not guaranteed to be the first argument.
- A number is a perfect cube if there exists an integer (`n`) where `n * n * n = number`. For example, 27 is a perfect cube because `3 * 3 * 3 = 27`.
# --hints--

2
curriculum/challenges/english/blocks/daily-coding-challenges-python/698a1a73ade5ac0e19180fa8.md
View File

@@ -9,7 +9,7 @@ dashedName: challenge-205
Given two integers, determine how many perfect cubes exist in the range between and including the two numbers.
- The lower number is not garanteed to be the first argument.
- The lower number is not guaranteed to be the first argument.
- A number is a perfect cube if there exists an integer (`n`) where `n * n * n = number`. For example, 27 is a perfect cube because `3 * 3 * 3 = 27`.
# --hints--