Closed stormsunshine closed 2 years ago
Hi @stormsunshine Thank you for reaching out to us. I've relayed this issue to our team to investigate.
Hi @stormsunshine, Thank you for your time, our team has reviewed your report and decided to keep the constraints as is. We appreciate your support!
Your LeetCode username
stormsunshine
Category of the bug
Description of the bug
For 1492. The kth Factor of n, the maximum values of both k and n are too small and a solution with time complexity O(n) can get accepted.
However, this problem has an optimized solution with time complexity O(√n) (√n means the square root of n), which is more likely to be expected during an interview. Since this problem is designed to accepted an O(n) solution, the values of n and k should still make the O(n) solution pass, but the values should be changed to larger values to distinguish between O(n) time complexity and O(√n) time complexity.
Therefore, the following two points can be enhanced.
Code you used for Submit/Run operation
The following code has time complexity O(n).
The following code has time complexity O(√n).
Language used for code
Java
Expected behavior