Loading collection data...
Collections are a way for you to organize kata so that you can create your own training routines. Every collection you create is public and automatically sharable with other warriors. After you have added a few kata to a collection you and others can train on the kata contained within the collection.
Get started now by creating a new collection.
should be added more test cases in NASM, i need to apelate to gpt to create more test to know where signal change im wrong, so frustating lost 1 hour because of it. add this case as default please
{
const int arrin[7] = {1, 0, -2, 0, 3, 0, -4};
test(arrin, 7, 3);
}
im getting some problem with this in randon tests, all the test is passing but in the randon tests, seens like the length passed in the argument and the array checking is wrong
this is cheating kkkkk
why ?
depending of the language this could an 5kyo
new programers think that oneliners solutions are good so they upvote them
you really need to undertand the math sintaxe to do this kata, but maybe an AI can help you to describe the math formula for you :D
you mean recursive function, do you?
this kata should be 6 kyu if the math at it was obvious.
for me this worked, but maybe for doing in C++
this kata is very interesting, i built my own fibonnaci formula inside my answer but, some people had a way to do this with simple math i didnt undertood how this work, but since my goal inst math but programming, so i think my answer is valid
to debug the solution put print(array), to see in what case your solution is failing and debug in another platform
i dont understand your point, in this case if the algorithm isnt timed out and works, its worthly, not em real scenarios like big data, but if the person can do this algorithm like O(n^2) or even o(n^3), once thsi get an solution with some improvements and searchs, the person could make the algoritm O(n) or maybe (nlogn)(in this case i dont know if its possible).
you are trying to solve the attempts not the problem itself, try to do your soluition in a carthesian plane and see if you gets in the beginning point
if you know well about cartesian plane this question is easy.
Loading more items...