my solution passes all test cases on one attempt, but doesn't on another. also, my solution doesn't pass the test cases given in the description

got it thanks

lol i guess so, divisible is what i meant by multiples and still doesn't make sense but i'll bookmark for later

i'm familiar with regular fizz buzz.

it doesn't make sense to me why in [1, "Fizz", "Buzz", "Fizz", 5, "FizzBuzz"] ==> [2, 3], 2 is "Fizz", while in the next example given, [1, "FizzBuzz", 3, "FizzBuzz", 5, "FizzBuzz"] ==> [2, 2], 2 is FizzBuzz.

the way the problem reads to me is that multiples of 2 are "Fizz", multiples of 3 are "Buzz", multiples of both are "FizzBuzz".

may someone please clarify?

the way you described the variable scrambled_word and base_word helped me realize what the problem was actually asking. this one has taken me months to understand. thanks

fun kata!

i don't get it

test cases are super annoying. it is much easier to work with when you can see the return values on a one by one test basis.

i don't think my code was truly sufficient to prove a valid phone number but still worked. to me a valid number only contains numbers but thats just me. i know that here are numbers like 1800codewar or something dumb like that

my brain can't handle the creativity i had to use to not use the keys method ;p

duplicate and almost positive my logic was incorrect but i still passed

feel like this would be fun but i don't understand the problem

ez

should be 7 or 8 kyu

was a little on the easy side but still fun