Question regarding why check low > 0
|
|
1
|
106
|
October 30, 2022
|
I think the following solution fits better in to the subject of this topic
|
|
1
|
117
|
May 26, 2022
|
Cleaner solution with same complexity as two pointer (O(logN+K))
|
|
1
|
109
|
March 25, 2022
|
We can further optimize and reduce the space and time complexity
|
|
0
|
117
|
January 3, 2022
|
Alternative Solution (Java). Is time comlexity correct?
|
|
0
|
118
|
December 7, 2021
|
Alternative Solution [Java]
|
|
2
|
189
|
July 2, 2021
|
K Closest Numbers - Given solution failing on this test case
|
|
1
|
220
|
June 19, 2021
|
K closest Number - Alternative Solution (Simpler) using previous question
|
|
1
|
158
|
June 10, 2021
|
K Closest Numbers - Solution without binary sort
|
|
1
|
180
|
April 25, 2021
|
In the binarysearch sample codes: why return low -1 when low >0
|
|
6
|
372
|
March 26, 2021
|
JS- result.sort()
|
|
1
|
169
|
March 26, 2021
|