maximum-distinct-elements-medium__pattern-top-k-elements__grokking-the-coding-interview-patterns-for-coding-questions
Topic | Replies | Views | Activity | |
---|---|---|---|---|
Time complexity can be O(n + klogn)? |
![]() ![]() |
1 | 49 | January 20, 2022 |
Can't the time complexity be reduced to O(N)? |
![]() ![]() ![]() ![]() |
4 | 133 | January 17, 2022 |
How to optimize the algorithm to only push K elements to heap? |
![]() |
0 | 36 | January 17, 2022 |