Nice solution.
A good optimization, should be to return false as soon as a letter of name is not found,
instead of waiting to check the whole word.
It makes the execution faster in case name is a very very long string.
This is my solution https://www.codewars.com/kata/reviews/59daf6b49d7fbd38ed000ec7/groups/686e2938d2116ba693ff964f
if you want to check.

nice

sry I mean snake case not camel case (got the other way round)

You've done snake case, not camel case.

yeaa because this is ruby which uses camel casing not JS

Is double_every_other preferred over doubleEveryOther in Ruby?

Thanks! That makes it clear now

Please consider this is used in a real codebase:

const foo = [2,3,5];
const bar = distributionOf(foo);
console.log(foo);

The above outputs [] instead of [2,3,5], because the array foo was modified from inside the distributionOf function. Functions shouldn't mutate their parameters.

hi there!
I am new coding, I solve this kata, but I really want to understand how you do it.
Could you please explain a lil bit for me.
Thank you, nice work!

Wow, multiline passwords? Give me two! :D

Nice, perfect solution. I had to check if you were the author, haha.

The table is a mapping between the number of the bowling pin and the index of that pin in the output string: 'I I I I\n I I I \n I I \n I '

For example, pin #7 is the first character in the string, index 0. Pin #8 is at index 2.

For each pin to be removed, I replace that index in the output string with a space.

This version might be a little clearer:

function bowlingPins(arr) {

  // locations is mapping of
  // pin: index
  const locations = {
    // Back row
    7:  0,
    8:  2,
    9:  4,
    10: 6,
    
    4:  9,
    5: 11,
    6: 13,
    
    2: 18,
    3: 20,
    
    1: 27
  }
  
  let pins = 'I I I I\n' +
             ' I I I \n' +
             '  I I  \n' +
             '   I   '
             
  pins = pins.split('')
  
  for (let x of arr)
    pins.splice(locations[x], 1, ' ')
    
  return pins.join('')
}