maximum-distinct-elements-medium__pattern-top-k-elements__grokking-the-coding-interview-patterns-for-coding-questions
| Topic | Replies | Views | Activity | |
|---|---|---|---|---|
| O(n) solution using an array instead of heap |
|
1 | 116 | August 10, 2022 |
| Time complexity should be O(N+N*logK) |
|
1 | 117 | August 10, 2022 |
| Time complexity can be O(n + klogn)? |
|
1 | 160 | January 20, 2022 |
| Can't the time complexity be reduced to O(N)? |
|
4 | 245 | January 17, 2022 |
| How to optimize the algorithm to only push K elements to heap? |
|
0 | 234 | January 17, 2022 |