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.
why all of that!!!!
Your code is buggy. It performs incorrect operations for this test case:
Assert::That(string_expansion("1a1"), Equals("a"));
.Your solution has a bug, it's not a kata issue.
yes, you can post your code here, just remember to use code blocks.
Expected: equal to "MMMMMPPPPPPPP" Actual: "MMMMMPPPPPPPP
what the hell is that? notice the missing double quotation mark at the end of my result (aka actual result), how is this possible, noting that my result is complete (same word between the quotation)?
is it ok to show you mine?
This means that most probably strings returned by you are corrupted in some way at the end. It's difficult to tell how exactly without seeing your code.
Expected: equal to "MMMMMPPPPPPPP"
Actual: "MMMMMPPPPPPPP
what the hell is that?
notice the missing double quotation mark at the end of my result (aka actual result),
how is this possible, noting that my result is complete (same word between the quotation)?
This comment is hidden because it contains spoiler information about the solution
https://www.codewars.com/kata/reviews/64f2de7573217a0001bc5d0c/groups/662e4ec01ca32c0001682074
here's my new solution, i came back after months and didn't notice that i already solved this kata, the new one might look decent at some level, enjoy :)
https://www.codewars.com/kata/reviews/64f2de7573217a0001bc5d0c/groups/662e4ec01ca32c0001682074
here's my new solution, i came back after months and didn't notice that i already solved this kata, the new one might look decent at some level, enjoy :)
the second if statement is ingenious, plus the next if that comes after it is also perfect, the -1 is used so that whether the last position is 2 or 1
(due to potential lack of noses in each case), the index at that if will always be the last position, hot implementation friend :)
dude youe code is far more complex than mine, here take a damn look:
https://www.codewars.com/kata/reviews/5a27dfc438fc2e72ff001979/groups/661617d1b084c9000117d0dc
for me, this was the best, simple, though powerful algorithm of all time (for this code of course!), keep it up champ.
I feel sick just looking at this solution.
I just threw up
Loading more items...