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.
Obstacle events when the door is not moving are odd and only happen in a few recent translations. I would prefer to fix the translations rather than consider this behaviour acceptable and update the description.
Yeah, I know what you are saying -- the reason my Katas normally do not have a "performance" requirement is because IMO that then tends to make all solutions just variations of the same algorithm or some maths trick (which only some people might know).
So I prefer to get many kinds of solutions (some good, some terrible) because it is interesting to see how other people think. Also, I think it is better to let everybody have a chance to solve the Kata, so when they see other solutions they can think "Oh, THAT is what I should have done!" -- IMO that is kind of the whole point of Codewars. YMMV.
Of course, in the real world performance really is important, so kudos to you if you wrote some efficient solution which also deals with huge input. Hopefully, other people will recognize it and mark it as "Best Practice".
Hi
Look, when doors are opened (5) and you press P you will start closing them. P pause doors move but only in case doors are not completely closed or opened.
First P start opening doors
Second P start closing doors (as doors are opened)
Third P pause closing doors
Fourth P unpause closing doors
In order to remove the problem with unexpected occurrences of a signal from detecting obstacles, I propose to make the following addition to the story.
Unfortunately, obstacle detection is unreliable and signals are possible even when the door is not moving. In this case, these signals should be ignored.
Listen guys...
I am disappointed. Why are all solutions a simple enumeration of elements. I spent a lot of my time from the New Year holidays, remembered a little math to find an algorithm with logarithmic complexity. I expected to see something like this and admire the elegance of the solution.
Of course, no Paint-Squad could draw millions of numbers, but the task of counting digits for intervals of millions of elements could be interesting.
My respects to dinglemouse for having fun.