Fold and Scan
The Array Cast
How to Find the Maximum Overall for the Heap Solution
I think the heap can be done in just linear time, order of a. And it's not, it's not using like O of one time on each step. So this solution you're describing is big, big O of a. The array solution would be O of a times log of k. But I mean, so I know eventually the O of k solution has to beat the O of there's.
00:00
Transcript
Play full episode
Remember Everything You Learn from Podcasts
Save insights instantly, chat with episodes, and build lasting knowledge - all powered by AI.
