How should I practice Sum of Distinct Prime Divisors?

Start by reading the full statement, solve the visible examples, then compare the pattern against related Microsoft onsite interview problems in FastPrep.

Is Sum of Distinct Prime Divisors associated with Microsoft?

FastPrep tags this as a Microsoft onsite interview coding practice problem when the problem catalog has that company and stage context.

Sum of Distinct Prime Divisors

Microsoft● MediumNEW GRADONSITE INTERVIEW

Learn

Problem statement

Given a positive integer n, return the sum of its distinct prime divisors.

Each prime divisor contributes once, regardless of its exponent in the factorization. For n = 1, return 0.

Function

sumDistinctPrimeDivisors(n: long) → long

Examples

Example 1

n = 12return = 5

The distinct prime divisors of 12 are 2 and 3, whose sum is 5.

Example 2

n = 13return = 13

Because 13 is prime, it is its only prime divisor.

Constraints

1 <= n <= 10^12