[BUG] - [719. Find K-th Smallest Pair Distance] time complexity isn't accurate enough

[NDR0216]

LeetCode Username

NDR0216

Problem Number, Title, and Link

719. Find K-th Smallest Pair Distance https://leetcode.com/problems/find-k-th-smallest-pair-distance/

Bug Category

Editorial

Bug Description

In Approach 2, the time complexity of "Populate the prefixCount array" is O(M), but it isn't included in the total time complexity.
Therefore, the total time complexity of Approach 2 should be O(nlogn+nlogM + M)

Populate the prefixCount array:

Iterate through possible distance values from 0 to maxPossibleDistance - 1.
For each distance value, determine the number of elements in the array nums that are less than or equal to this distance.
Store this count in prefixCount for the current distance.

Language Used for Code

None

Code used for Submit/Run operation

No response

Expected behavior

Approach 2
Time complexity: O(nlogn+nlogM + M)

Screenshots

No response

Additional context

No response

[exalate-issue-sync]

Epiphania_Ekenimoh commented: Hello,

Your reported issue has been relayed to our team for thorough investigation. We appreciate your patience as we work to address and resolve this matter. We will reach out to you when we have updates regarding the issue.

If you have any further questions or concerns in the meantime, please feel free to let us know.

Best regards,
LeetCode Support Team

[exalate-issue-sync]

Epiphania_Ekenimoh commented: Thank you for your time.

Your feedback has been used to enhance the problem. As a token of our appreciation, your LeetCode account has been credited with 100 LeetCoins.

If you have any more questions or additional feedback, please don't hesitate to let us know. Your continued support is invaluable to us!

Best regards,
The LeetCode Team