I agree. The question suggests that the strng is a bunch of letters followed by numbers, not !@$#%$@%53632gs#@$@%$#32g436. I tailored my solution to solved the first not second kind of test case. If I want to get this kata marked as solved, I am going to have to start from scratch (which I won't)!
Could there be entries other the examples you have give.
If there are, please add one or two more examples,
because my code can successfully pass the entries you have give plus the one on the test.
"Not knowing what to do" and "not being able to get the code to work" do not constitute a valid kata issue.
Your solution contains a bug. I think you could find it quite easily recreating failing test case in your IDE and debugging it locally. I was able to fix your solution with a minor change and get it accepted.
Actually you do not need any advanced prime generator to solve this kata in Python. My implementation is quite naive and still takes ~1s to run full test suite. You need to make sure you do not calculate too much, but there's no need for anything really advanced.
I agree. The question suggests that the strng is a bunch of letters followed by numbers, not !@$#%$@%53632gs#@$@%$#32g436. I tailored my solution to solved the first not second kind of test case. If I want to get this kata marked as solved, I am going to have to start from scratch (which I won't)!
Could there be entries other the examples you have give.
If there are, please add one or two more examples,
because my code can successfully pass the entries you have give plus the one on the test.
What should be the RIGHT answer for this entry 'abcd23abdcbd99' and '123' according to this Kata?
I agree. I don´t understand why this suggestion is still unresolved ? Only the kata´s sensei can do it ?
Thank you.
I now know what I've done wrong.
I guess my initial argument should be: "Should I know better of what to do with FRACTIONs?"
"Not knowing what to do" and "not being able to get the code to work" do not constitute a valid kata issue.
Your solution contains a bug. I think you could find it quite easily recreating failing test case in your IDE and debugging it locally. I was able to fix your solution with a minor change and get it accepted.
A paragraph to read: https://github.com/codewars/codewars.com/wiki/Troubleshooting-your-solution#post-discourse
It won't help you to fix the problem, but it could help us to help you.
This comment is hidden because it contains spoiler information about the solution
@python
Should I know better of what to do with big numbers?
codewars numpy is a bit old (has no lcm function), also lcm is default from the math library from python 3.9+
Every lcm I implement seems to fail with large numbers...
What am I doing wrong? (Code on the next post)
Please consider adding this info:
This will avoid complains, a lot of complains...
This comment is hidden because it contains spoiler information about the solution
Thanks. I did not took notice of the cut message from the screenshot.
Actually you do not need any advanced prime generator to solve this kata in Python. My implementation is quite naive and still takes ~1s to run full test suite. You need to make sure you do not calculate too much, but there's no need for anything really advanced.
It literally mentions above that it's testing signature of 3 elements...
The screenshot is about the output, not the input of your code.
Loading more items...