codefights arcade The Core task 42

makeArrayConsecutive2
https://codefights.com/arcade/code-arcade/list-forest-edge/bq2XnSr5kbHqpHGJC

♡ twitch stream: https://twitch.tv/jsthegame
♡ twiter: https://twitter.com/JStheGame
♡ facebook: https://www.facebook.com/JStheGame
♡ donate (if you want): https://streamlabs.com/jsthegame


algorithm 1
sort the original array, loop through it and compare each element to the previous one, to find how many numbers are missing

topics:
- array method `.sort` will need a sorting function if you wanna sort numbers (the default is lexicographic sorting; word sorting, like the dictionary or the phone book)
- note: we start the loop at `i = 1` since we're comparing to the previous element each time


algorithm 2
finding the maximum and minimum elements, getting the difference, and subtracting the number of elements we have

topics:
- use array method `.length` to find how many elements we have
- the value of good variable names - makes it clear to the reader what's going on, reduces the need for comments in the code
- technically it would be more efficient to go through the array once to find the max and min, but in this case it's pretty negligible
- destructuring assignments expect an array, but it doesn't really matter where it comes from (so for example, in this case we use a `.map` since we're doing the same kinda thing for both values)