Available question text
Repeatedly replace n with the sum of its prime factors (counting multiplicity) until it no longer changes, and return the smallest value reached. The core challenge is performing efficient repeated prime factorization / detecting when a fixed point (e.g., a prime or 4) is reached for n up to 10^5.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 2507. Smallest Value After Replacing With Sum of Prime Factors
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source