Consecutive letters

Consecutive lettersCodewars

Approach

solve the problem

1. split as character

2. sorting for comparison

3. compare through reduce

   1. if accumulator char code + 1 is not same current char code return false;

   2. if all test passed return last character

4. !!(last character) is true so the result will return boolean

Solution

JavaScript

const solve = (s) => !![...s].sort()
  .reduce((acc, cur, i, arr) => {
    if (acc.charCodeAt(0) + 1 !== cur.charCodeAt(0)) {
      arr.splice(0);
      return false;
    }
    return cur;
  });