How should I practice Maximum Square-Free Divisor?

Start by reading the full statement, solve the visible examples, then compare the pattern against related Intuit online assessment problems in FastPrep.

Is Maximum Square-Free Divisor associated with Intuit?

FastPrep tags this as a Intuit online assessment coding practice problem when the problem catalog has that company and stage context.

Maximum Square-Free Divisor

Intuit● EasyFULLTIMEOA

Learn

Problem statement

Your friend gives you a positive integer n. Find the largest positive divisor d of n that is not divisible by any perfect square greater than 1.

Equivalently, d must not be divisible by k^2 for any integer k >= 2. Such a number is called square-free. Return the maximum possible d.

Function

solve(n: long) → long

Examples

Example 1

n = 4return = 2

The divisors of 4 are 1, 2, and 4. The divisor 4 is divisible by the perfect square 4, while 2 is square-free. Return 2.

Example 2

n = 1return = 1

The only positive divisor is 1. No perfect square greater than 1 divides it, so return 1.

Example 3

n = 72return = 6

72 = 2^3 * 3^2. A square-free divisor can use at most one factor of 2 and one factor of 3. Taking both gives the largest valid divisor, 6.

Constraints

1 <= n <= 10^12.
The input and return value use signed 64-bit integers.