diff --git a/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/self-describing-numbers.english.md b/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/self-describing-numbers.english.md index 09964a0f3c..539db9e862 100644 --- a/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/self-describing-numbers.english.md +++ b/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/self-describing-numbers.english.md @@ -6,11 +6,11 @@ challengeType: 5 ## Description
-There are several so-called "self describing" or "self-descriptive" integers.
+There are several so-called "self describing" or "self-descriptive" integers. -An integer is said to be "self-describing" if it has the property that, when digit positions are labeled 0 to N-1, the digit in each postion is eqal to the number of times that that digit appears in the number.
+An integer is said to be "self-describing" if it has the property that, when digit positions are labeled 0 to N-1, the digit in each position is equal to the number of times that digit appears in the number. -For example, 2020 is a four-digit self describing number:
+For example, 2020 is a four-digit self describing number: -Self-describing numbers < 100.000.000 are: 1210, 2020, 21200, 3211000, 42101000. +Self-describing numbers < 100,000,000 are: 1210, 2020, 21200, 3211000, 42101000.
## Instructions
-Write a function that will check whether a given positive integer is self-describing. +Write a function that takes a positive integer as a parameter. If it is self-describing return true. Otherwise, return false.