Prime Factorization · Coding Interview Practice

Prime FactorizationGiven an integer n, return its prime factors in ascending order, repeating each factor as many times as it divides n.Constraints

2 <= n <= 10^9

Factors must be listed with multiplicity

Examples

Input: n = 60 Output: [2,2,3,5]

Input: n = 97 Output: [97]

LetsDiscuss

Loading your session…