1492. The kth Factor of n

Medium

991

241

You are given two positive integers `n`

and `k`

. A factor of an integer `n`

is defined as an integer `i`

where `n % i == 0`

.

Consider a list of all factors of `n`

sorted in **ascending order**, return *the *`k`

^{th}* factor* in this list or return `-1`

if `n`

has less than `k`

factors.

**Example 1:**

Input:n = 12, k = 3Output:3Explanation:Factors list is [1, 2, 3, 4, 6, 12], the 3^{rd}factor is 3.

**Example 2:**

Input:n = 7, k = 2Output:7Explanation:Factors list is [1, 7], the 2^{nd}factor is 7.

**Example 3:**

Input:n = 4, k = 4Output:-1Explanation:Factors list is [1, 2, 4], there is only 3 factors. We should return -1.

**Constraints:**

`1 <= k <= n <= 1000`

**Follow up:**

Could you solve this problem in less than O(n) complexity?

Accepted

113K

Submissions

179.9K

Acceptance Rate

62.8%

Seen this question in a real interview before?

1/4

Yes

No

Discussion (0)

Related Topics

Copyright ©️ 2023 LeetCode All rights reserved