I think the suggestion about casing is a good one; if I understand you correctly, that would mean fixing the name if it's not uppercased (e.g. hello('george') would result in "Hello, George"
List generation takes lots of time. Submitting pass takes 9 seconds, while submitting an actual solution takes the same 9 sec. Also, it's not critical.
Hi. At the end of the kata you have an example but it is not very clear... the key is not repeat or skip notes to get the required distances pattern. For example from D to E we can get a half tone in to ways 'D' -> 'Eb' or 'D' -> 'D#' the valid one for the kata is the first.
solve one (or more) of "with restrictions" katas and check the test cases :) The checks I use aren't bullet-proof. Actually they are intentionaly cheatable as the point of these kata is to get creative solutions and not to force to solve them in one specific way.
was added to description
This comment is hidden because it contains spoiler information about the solution
This one is close: https://www.codewars.com/kata/returning-strings
I think the suggestion about casing is a good one; if I understand you correctly, that would mean fixing the name if it's not uppercased (e.g. hello('george') would result in "Hello, George"
I retrained after reading your comment and I couldn't find what you were referring to.
List generation takes lots of time. Submitting
passtakes 9 seconds, while submitting an actual solution takes the same 9 sec. Also, it's not critical.Hi. At the end of the kata you have an example but it is not very clear... the key is not repeat or skip notes to get the required distances pattern. For example from D to E we can get a half tone in to ways 'D' -> 'Eb' or 'D' -> 'D#' the valid one for the kata is the first.
Hi,
solve one (or more) of "with restrictions" katas and check the test cases :) The checks I use aren't bullet-proof. Actually they are intentionaly cheatable as the point of these kata is to get creative solutions and not to force to solve them in one specific way.
Regards,
suic