Kata

Pretty challenging this one, good job.

Was fun, if you are using global variables be careful, variables from previous testcases could be used in the next one so you always should declare the new value regarding the global variable at the start of a nonrecursive function :) I guess noone needs that :)

I'd say it's nice to tell the user what the max count of numbers would be. It really does change the way one solves this.

It's still a good kata. And yes, I know it won't get changed, just commenting.

python new test framework is required. updated in this fork

1. The description says "less than the value of limit" whereas tests expect "less than or equal to the value of limit".
2. Performance tag needs to be added.
3. Would be good to have more complex cases as part of initial tests.

dotest(&[71,211], 937166421704, Some((11, 380692393061)));
dotest(&[97,173], 7942971572284, Some((13, 4725562507541)));

What a great kata, SubhanAllah!! Really really enjoyed solving... Alhamdulillah!! I tried other two approches which were rather difficult, but the path to success is infact straight and easy.
Thanks raulbc777!

just passed 111, bigger tests are taking time, just now have a new idea to change the total approach but ........

Lack of many languages

D translation

Hello everybody! Could someone give me idea, how to solve this kata. Now I'm stacked....

One of the most challenging kata that I've done!!!

• Rust translation
• Go translation

Surely this test case in python is incorrect since 13 is a prime number therefore cannot be factored into primes 2 and 3

primesL = [2,3] limit = 200 test.assert_equals(count_find_num(primesL, limit), [13, 192])

COBOL translation, please review carefully. I didn't change the description because that would mean add specific language redundant blocks, and it would not add any extra value. A sane solution would be to make the description language agnostic.

In addition to the unresolved issues pointed out by Blind4Basics, the kata is inconsistent in references to the function and parameters:

Initial solution code: count_find_num(primesL, limit)

Kata description: count_find_num(primesL, val) <- this appears once find_nums(primesL, limit) <- this appears twice

Hi Raul,

Seems there are some inexactitudes in the description:

• your tests are asking for the max number below or equal to limit while you wrote the largest number under limit (which I interpreted as <)
• at the beginning, you should remove try to generate in order seens it's not tested.

cheers

kata broken (python) by the new runner. Need access to the edit panel and corrections

Approved

Minor updates done on the description.

BTW, for the random tests, random.sample() makes life easier :-)

After finishing this kata, I felt like sharing a simple, python-version-safe, but dirty way to calculate the product of a list of numbers :-)

list_prod = eval('*'.join(map(str, numbers_list)))

Nice kata. :-)

I had to: from operator import mul to pass the tests. You should import this function in the test code in case the solution does not import it