Question
Given an integer n (1..10^7), a factor combination is a way of writing n as a product of integers each >= 2 (and each strictly less than n itself, so the trivial [n] is excluded). Return all such factor combinations, each as a non-decreasing list of factors, with the overall result sorted ascending. If n has no non-trivial factorization (e.g. it is 1 or prime), return an empty list.
get_factors(n: int) → list[list[int]][12]out[[2,2,3],[2,6],[3,4]]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.
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.