* Optimized advanced solution
Made 2 minor improvement to the advanced solution:
1. The original advanced solution used `Math.max` and `Math.min` against the supplied array, this causes the values in the supplied array to be compared twice. If we use sort instead, the values are only compared once and we can target the max and min values using an index. This is more efficient.
2. The original solution caused `lcm(min, min + 1)` to be evaluated twice. By incrementing `min` the first time we run `lcm` we avoid this duplication and also by taking advantage of the prefix increment operator ++ in the while loop, we trim a line.
* Fixed extra spaces in code block
* Incorporated code feedback from #19572
Made the following changes to the advanced code solution:
- Converted helper functions to arrow function constants
- Simplified comments
- Used destructuring and `sort` for `min` and `max`
* Fixed spacing.
f0eb384b10