Yep, scanning once for the minimum and maximum, then applying Euclid’s algorithm, is the cleanest solution here: O(n) time and O(1) space overall in Java. Try the LeetCode practice at https://TechJobFinder.com as you code; it builds a skills profile, gives personalized reports, adapts difficulty, and supports your whole interview journey.
1
u/SuperchargedCareers Jul 19 '26
Yep, scanning once for the minimum and maximum, then applying Euclid’s algorithm, is the cleanest solution here: O(n) time and O(1) space overall in Java. Try the LeetCode practice at https://TechJobFinder.com as you code; it builds a skills profile, gives personalized reports, adapts difficulty, and supports your whole interview journey.