5 kyu
Count chains of ones in subsequences
14 of 19dramforever
Loading description...
Algorithms
Performance
View
This comment has been reported as {{ abuseKindText }}.
Show
This comment has been hidden. You can view it now .
This comment can not be viewed.
- |
- Reply
- Edit
- View Solution
- Expand 1 Reply Expand {{ comments?.length }} replies
- Collapse
- Spoiler
- Remove
- Remove comment & replies
- Report
{{ fetchSolutionsError }}
-
-
Your rendered github-flavored markdown will appear here.
-
Label this discussion...
-
No Label
Keep the comment unlabeled if none of the below applies.
-
Issue
Use the issue label when reporting problems with the kata.
Be sure to explain the problem clearly and include the steps to reproduce. -
Suggestion
Use the suggestion label if you have feedback on how this kata can be improved.
-
Question
Use the question label if you have questions and/or need help solving the kata.
Don't forget to mention the language you're using, and mark as having spoiler if you include your solution.
-
No Label
- Cancel
Commenting is not allowed on this discussion
You cannot view this solution
There is no solution to show
Please sign in or sign up to leave a comment.
would be nice/useful to have a sample test like "1100011100111".
Okay, but may I ask why? I might be able to clarify the description.
Done
Java Translation Note to people who are going to translate it into Python: Python is, well, well known slow. I tried my best but performing a 2e6 test still cost 600ms... Consider one can spawn any script in Python (like invoke a node script), it will give too much time for challengers (or not enough time)... So i decided not to translate it into Python.... If someone is good enough in Python optimization, please try do it o_O
LGTM, and I trust you.
Approved!
Did YOU mod? ;-)
Sometimes.
Sorry about that :( fixed
Your random tests is at least 200 length... Could you please kindly add some shorter cases (10, 20...) to make it easier to debug...
Done
Random hint: did you 'modulo 4294967296'?