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.
no problem, good luck)
ah got it, my bad on the count of 'v'. will edit my answer to deal with this problem. thanks!
hey jeroenpol, can you write your answer like it
{
index: 13,
addedText: "sass",
deletedText: "a"
}
Hey yuhaocooper, thanks for your message, if we add 'v' in 14 position and remove one space we will get:
'vvvvvvv vvvvvvvvvvvvv'
but we need to have
'vvvvvvv vvvvvvvvvvv'
Hi, i'm having some issue with the this test case above. I'm able to pass everything but this case. The solution suggest
Index: 14, added: '', deleted: ' v'
My solution gets
Index: 14, added: 'v', deleted: ' '
Which fulfills all the conditions listed in the description. Is there something wrong?This comment is hidden because it contains spoiler information about the solution
Three different ways with less than 1s for tests and still timing out
thanks for the tip. ended up solving it without any loops
thanks for the help! finally managed to solve it once i thought of a different idea
Try to solve it without "for" or "while". Attention: can blow your mind.
The problem is with your Math function. It works recursively, and can't handle huge arrays. Here's a thread about it.
You can try implementing that, but there are other ways to solve it without these functions.
This comment is hidden because it contains spoiler information about the solution
Well, clearly you end up in too deep recursion somewhere. Try posting the code, but do mark it as spoiler and format it properly, so we can help you identify the problem.
I'm getting RangeError: Maximum call stack size exceeded upon attempting the solution and I have no idea how to solve this problem.
I'm passing all the test cases, and returning the results within 1500ms. Can someone guide me in the right direction? I've researched that call stack size errors are due to recursive functions, but I don't have a recursive function in my solution...