Code Room
CodingMedium
Question
Given an integer n (2 <= n <= 200000), factorize it into its prime factors using a precomputed smallest-prime-factor (SPF) sieve, and return the list of [prime, exponent] pairs sorted by ascending prime. For example 360 = 2^3 * 3^2 * 5 returns [[2,3],[3,2],[5,1]].
Implement
factorize_spf(n: int) → list[list[int]]Examples
in
[360]out[[2,3],[3,2],[5,1]]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.