GCD and LCM
Given a list of positive integers (length 1..1000, each value 1..10^9), return [g, l] where g is the GCD of all of them and l is the LCM of all of them, with l reduced modulo 10^9+7 (the true LCM can be astronomically large). Compute LCM incrementally as a*b//gcd(a,b) on the true integers, then take the answer mod 10^9+7 at the end.
Implement
gcd_lcm_all(nums: list[int]) → list[int]Examples
in
[[4,6,8]]out[2,24]What a strong answer looks like
State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.
0:00 of about 18 min
solution.py
InputExpectedGot
[[4,6,8]][2,24]not run yetsample