Hi ! I’ve been trying to solve the [https://www.freecodecamp.org/learn/javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/drop-it] Question where the LCM of all the numbers in the range provided is to be found.
I tried my own methods by mainly using modulus operator but the script timed out for larger ranges.
I used Euclidean algorithm [https://stackoverflow.com/questions/3154454/what-is-the-most-efficient-way-to-calculate-the-least-common-multiple-of-two-int] referenced in this answer and implemented it to finally get the answer.
Is this cheating?