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.
Python 3.8
Reset/default state code should be changed from
to
Reason: arguments and variables should not match module names or functions. Style guide says that if they must, leading them with an underscore should be done.
While this may hold value for teaching kata solvers to examine the arguments given, and change them as they need to - I am uncertain if this is the intended "problem" of this kata. All it does is send greenhorn coders on a wild goose chase trying to answer the error code of...
"AttributeError: 'str' object has no attribute 'ascii_lowercase'"
which I do not feel to be easy to resolve as a beginner.
Now, I do concede it gave me some good troubleshooting experience ("Wait... what happens if I... Oooh!") but, I'm not sure if that's the intended challenge.
There are, but I believe due to size of the description, they do not show on main page.
It took me a bit to notice you can scroll down kata descriptions - so I suggest just that!
However one of the examples given was... (note the Whitespaces, Python)
This comment is hidden because it contains spoiler information about the solution
Are you using print() as a debugging tool?
If so, consult: https://docs.codewars.com/training/troubleshooting/#maxbuffer
It should answer all your issues!
That's part of the challenge! Can you recognize the pattern at play?
I really got to learn functions already available in Python.
My solutions look oversized, and this one makes it feel worse.
This comment is hidden because it contains spoiler information about the solution
It is clear about repetitions, albeit not in common language.
"Multiplicity" is the keyword:
Both a and b must correspond in value, and multiplicity.
Where multiplicity refers to duplicates.
This comment is hidden because it contains spoiler information about the solution
This comment is hidden because it contains spoiler information about the solution
This comment is hidden because it contains spoiler information about the solution
A contiguous sequence is as follows.
A, B, C, D, E , F
ABC is a contiguous sequence. ABD is not.
CDEF is a contiguous sequence, ACDEF is not.
DEF is a contiguous sequence, FED is not.
Delete everything under the
def max_sequence(arr):
when starting.The empty code given by the writer seems to cause issues (probably a sneaky space somewhere).
Are you inserting names or names[n] into the output string? (where n is 0-2 depending on case?) (python, but probably generalisable)
If you are inserting names, you are inserting a list which has its own formatting.
If you are inserting names[n], you are inserting a string at location n in the list "names".
You can use print (or equivalent in your language) to make the tests show in console. With good choice of what to print, and notation - you can easily debug why that's happening.
Loading more items...