CodingMediumcod-g172

Subject Gcd lcmLevel Mid–Senior~15 minCommon in Algorithms & data structures interviewsIndustries Software development

Question

Return the smallest positive integer that is evenly divisible by every integer from 1 to n inclusive — that is, the least common multiple of the range [1, n]. For example, for n = 3 the answer is 6, and for n = 10 it is 2520. Assume 1 <= n <= 25 so the result fits in a 64-bit integer.

Implement

lcm_of_range(n: int) → int

Examples

in[3]out6

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.

Learn the concepts

Vibe coding: describe the solution in plain language (or narrate it) and the coach grades your approach. Generating runnable code from your description is coming next.

Run or narrate your approach, then ask the coach.