Highest Rank Number in an Array

Highest Rank Number in an ArrayCodewars

Approach

Solve the problem

1. count numbers through 'reduce', set init value 'Map' and reducing it

2. convert as array [[key, value], [key, value]...]

3. sort by value (order by desc), if value same sort by key (order by desc)

4. return process-3's first value set's key which means array[0][0]

Solution

please don't be mad, it's just for fun.

if it's for work I would never wrote like this.

I very care about readability

JavaScript

const highestRank = (arr) => [...arr.reduce((acc, cur) => {
  acc.set(cur, (acc.get(cur) || 0) + 1);
  return acc;
}, new Map()).entries()]
  .sort((a, b) => {
    if (a[1] !== b[1]) {
      return b[1] - a[1];
    }
    
    return b[0] - a[0];
  })[0][0];