Prize Draw

Prize DrawCodewars

Approach

1. check st value length. if it's 0 return 'No participants'

2. check st value names length. if it's less than *n it's not able to figure out so return 'Not enough participants'

3. define names variable and init with seperated value of *st

4. iterate process-3

   1. return [names[i] and (names.length + names character accumulate values) * weight[i])

5. sort process-4 as DESC though element[1] value. if value is name order by ASC with name which means element[0]

6. return process-4[n-1][0]

Solution

JavaScript

const rank = (st, we, n) => {
  if (st.length === 0) {
    return 'No participants';
  }
  if (st.split(',').length < n) {
    return 'Not enough participants';
  }
  
  const names = st.split(',');
  const weightedNameList = names.map((name, i) => {
    return [
      names[i],
      (name.length + name.toLowerCase()
        .split('')
        .reduce((acc, cur) => acc + cur.charCodeAt(0) - 96, 0)) * we[i],
    ];
  });
  
  weightedNameList.sort((a, b) => {
    if (b[1] === a[1]) {
      return a[0].localeCompare(b[0]);
    }
    return b[1] - a[1];
  });
  
  return weightedNameList[n - 1][0];
};