6kyu_ChocolateParty.js

// 7kyu - Chocolate Party

// Class 3A are chocoholics, and they are excellent at sharing.

// If they work hard all week, they get a chocolate party on Friday!

// In the classroom, there are 6 tables. The first table has one bar of chocolate, 
// the second table has two bars of chocolate, the third table has three bars and so on.

// The children enter the classroom one at a time. They must sit down at the table
// where they get the most chocolate. If there is a choice between two tables, they 
// will prefer to sit at the table nearest to the door (the first table is closest 
// 	and the sixth table is furthest from the door).

// For a given number of children, n, return an array that shows how many children 
// are sitting at each table.

// e.g.

// n = 10

// Child 1 sits at table 6, getting 6 bars of chocolate
// Child 2 sits at table 5, getting 5 bars of chocolate
// Child 3 sits at table 4, getting 4 bars of chocolate
// Child 4 sits at table 3, getting 3 bars of chocolate
// Child 5 sits at table 6, 2 children each get 3 bars of chocolate
// Child 6 sits at table 5, 2 children each get 2.5 bars of chocolate
// Child 7 sits at table 2, getting 2 bars of chocolate
// Child 8 sits at table 4, 2 children each get 2 bars of chocolate
// Child 9 sits at table 6, 3 children each get 2 bars of chocolate
// Child 10 sits at table 5, 3 children each get 1 and two-thirds bars of chocolate

// result = [0, 1, 1, 2, 3, 3]

// Your solution will be tested with random integer and non-integer values from 
// -10000 to 10000. The test input will always be a valid number.

// If the number of children is not a valid number of children (is zero, is 
// 	negative, or is not a whole integer) or there is no input, your function 
// should return null.

function shareChocolate(n) {
  if (n < 1 || n%1 !== 0) return null;
  let tables = [0,0,0,0,0,0], i = 0;
  for(let i = 0; i < n; i++) {
    let chocolate = tables.map((kids, choco) => kids ? (choco+1)/(kids+1) : choco+1)
    const idx = chocolate.indexOf(Math.max(...chocolate))
    tables[idx]++;
  }
  return tables;
}