Code Room
CodingMedium
Question
Given an integer n (n >= 1), return all combinations of its factors, each greater than 1, whose product equals n. Each combination must be in non-decreasing order, and you should not include the trivial single-factor combination [n] itself. Return the list of combinations sorted lexicographically. n is at most 100000.
Implement
get_factors(n: int) → list[list[int]]Examples
in
[12]out[[2,2,3],[2,6],[3,4]]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.