Hello,

For this question. Does there exist an optimal solution, i.e., processing each query in O(1) or O(log K) time or some significantly efficient way if the constraints were higher for each query?

Thank you for reading, L

Hello,

I was looking for solving problems based on Prefix max/min and Suffix max/min. Maybe something like trapping rainwater and something like this. If anyone has some good leads regarding that kindly let me know.

Thanks for reading, L

Hello,

I've been trying to find a problem set based on overlapping intervals but couldn't find quite enough. Can anyone suggest me some in the same domain?

Some of the examples include: 1. Max num of intervals an interval can intersect 2. Meeting rooms II 3. Maximum number of subsets of overlapping intervals 4. Merge Intervals and so on..

Thanks.

Hi,

I've been trying to learn to solve problems based on binary search and prefix sum. Here is one question that I've come across. Can anyone suggest me a couple more.

Thanks