sliding-window-median-hard__pattern-two-heaps__grokking-the-coding-interview-patterns-for-coding-questions
Topic | Replies | Views | Activity | |
---|---|---|---|---|
Why not two binary search trees? |
![]() ![]() ![]() |
2 | 120 | January 23, 2022 |
Sliding window Median Problem - Remove Function |
![]() ![]() |
1 | 107 | October 8, 2021 |
Can't we do it faster in O(nlog(k))? |
![]() ![]() |
1 | 94 | August 27, 2021 |
Why time complexity is O(N * K) rather than O(N LogK)? |
![]() ![]() ![]() |
2 | 200 | August 16, 2021 |
Max Heap initialization (reverse order comparator) |
![]() |
0 | 252 | January 11, 2020 |
Quick Clarification |
![]() |
0 | 216 | January 26, 2020 |
Why use heaps here? |
![]() ![]() ![]() |
3 | 406 | April 18, 2020 |