This would be 7 kyu if it didn't have the performance constraint.

If you're at 2 Dan with 3000 Katas solved, I'm sure.

But this is marked 7 kyu, which is absurd.

i understand that its a function named numMinusSeven and that theres a condition (ternary operator). besides that i have no clue how this works

• which parts do you understand?
• which parts do you not understand?

please explain

Here are all the natural numbers not exceeding 40 that are not divisible by 2, 3, or 5 without a remainder:

1, 7, 11, 13, 17, 19, 23, 29, 31, 37

These numbers are not divisible by 2, 3, and 5 without any remainder.

Saying that this kata is simple is rather a misnomer. Definitely not a 7kyu.
Might be easy for you if you remember a very specific math lesson from school.
Otherwise there is no chance to deduce the solution.

Some kind of merge conflict so had to fork, but approved, thanks!

I got it
thank you so much

Read this again:

You need to write a function which finds the number of natural numbers not exceeding N and not divided by any of the numbers [2, 3, 5].

There are 10 numbers <= 40 that satisfy that condition.

1, 7, 11, 13, 17, 19, 23, 29, 31, 37

how the result here is 10!!!!!! [40, 10]
10/5 = 2
10/2 = 5
anyone expalin ????!!!!!!!

The kata description asks what the last number Jason says, but doesn't say what numbers he says rather than calculates.
start - what number Jason starts counting from implies that he says the first number, but there is no mention of saying other numbers, only calculating them.

nice kata .

I've tried several solutions, including some from ChatGPT using set theory...and my solutions keep timing out.

• In your Description you state 2 seconds if subtracts N from a one-digit number (if 1 <= start <= 9). In order to pass the tests in your kata however, 0 is also treated as a one-digit number. For that reason, your description should be changed to 2 seconds if subtracts N from a one-digit number (if 0 <= start <= 9)

• Negative cases should also be provided as example tests