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.
Ok, someone already found not expected and better solution.
Going to put this kata on hold.
The main part of algorithm, it's hard to explain.
Perhaps changing the description (i has thinking about, " after the processing of ranges and etecetera").
Or just removing the commentary, but it's a helper. Yes is different
N
.O(N)
? But the number of elements in the result isO(len(arr)^2)
, so it must be bounded below byO(N^2)
. Or is this a differentN
from the length of the array?exactly
Ah cool cool. The original description is so obtuse isn't it?
I also figured out some time ago: https://www.codewars.com/kata/6637804bb95494336d6eba73/discuss#6637af6c60745e046b2490f3
I figured it out. But I had to unlock the solutions and read someone else's code to do it.
I've made a suggestion in this discussion to rewrite the instructions, and given my own explanation as to what to do. I hope it helps... https://www.codewars.com/kata/6637804bb95494336d6eba73/discuss/javascript#665dbab905322f7b983a5401
The tests are not very helpful. Not sure if you have control over that or not--I used to make katas years ago. But we used to be able to put a message into the test so it actually said a bit about what it was testing. Just getting "it should've been this other number" isn't useful as a message. And it seems only the last test is shown or something?
Oh man, it was a real struggle to understand what I was even meant to do. I think it's just how it was explained.
The way I would explain it is:
(Calling this a "first maximum rising sequence" is super wordy and confusing, so I've renamed is to "flush" for demonstration purposes.)
It's very confusingly written. Trying to figure it out now...
f(n) = (n/2) mod m
is ambiguous because it is not amodular division
, it is a division by 2 in the integers and then a modulo.valueVerificationArray
(that should be in Pythonvalue_verification_array
) are always the same...Well, i been thinking the same thing. Ok.
If this is to be a
7 kyu
kata, it should not have a performance requirement. Tag it withDP
and estimate it at6
, and my hesitation to upvote might go away.Done.
Done.
Loading more items...