Does it pass without needing to bypass the infinite loop protection? It still seems to be looping a lot for the calculation.
If you are really stuck you should start looking at the code camp challenge guide
https://forum.freecodecamp.org/t/freecodecamp-algorithm-challenge-guide-smallest-common-multiple/16075
Also, I don’t think you have really fixed the sort issue . I think you have just configured your loops to work with the largest number first after reversing the array. To use the .sort function on numbers you will need to create your own comparison function. Look on MDN for the example using numbers not strings.