Broken on Python. When submitting getting a timeout error. Tested up to 10000 on my local machine and no issues. Completing the test portion in .2ms with no errors, but the submit version hangs and then fails.
You changed the required signature of the function. It should return, quotint the description, "top rows of Pascal's Triangle flattened into a one-dimensional list/array", and you changed it to int[,].
Usually problems are related to overflow, and you can verify this by comparing your results to, for example, results returned by Wolfram: https://www.wolframalpha.com/input/?i=binomial%2860%2C30%29 .
Run your solution locally for n=60, dump the answer to the console, and check numbers in the middle of the row, because these are the largest: (59 28), (60 30) etc.
It's possible that your calculations either overflow, or are inaccurate due to floating point division.
Very good description. Good Job putting the gif in there.
2000+ completions in JS, no explanations provided. I'm gonna say... not a kata issue, likely a problem with your code.
https://github.com/codewars/codewars.com/wiki/Troubleshooting-your-solution
This Kata is broken in JS
Always getting timeout error when submitting the solution in pyhton. Working well when testing (0.3s)
I really liked it, thanks!
This comment is hidden because it contains spoiler information about the solution
No, it is not. I've just completed this in python.
Broken on Python. When submitting getting a timeout error. Tested up to 10000 on my local machine and no issues. Completing the test portion in .2ms with no errors, but the submit version hangs and then fails.
For future translation please use python new test framework. (I'll fix this one, though)
https://en.wikipedia.org/wiki/Fibonacci_number it depends on how it's defined.
Fibo start with ZERO, one, one, two...
1 ==n
return 0;
2 ==n
return 1;
1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144
will be
0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144
nice little kata, could you add a Java option please?
You changed the required signature of the function. It should return, quotint the description, "top rows of Pascal's Triangle flattened into a one-dimensional list/array", and you changed it to
int[,].This comment is hidden because it contains spoiler information about the solution
Usually problems are related to overflow, and you can verify this by comparing your results to, for example, results returned by Wolfram: https://www.wolframalpha.com/input/?i=binomial%2860%2C30%29 .
Run your solution locally for n=60, dump the answer to the console, and check numbers in the middle of the row, because these are the largest: (59 28), (60 30) etc.
It's possible that your calculations either overflow, or are inaccurate due to floating point division.
Loading more items...