AI-powered
podcast player
Listen to all your favourite podcasts with AI-powered features
2min chapter
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
Episode notes
Get the Snipd
podcast app
Unlock the knowledge in podcasts with the podcast player of the future.
AI-powered
Discover
highlights
Listen to the best highlights from the podcasts you love and dive into the full episode
Save any
moment
Hear something you like? Tap your headphones to save it with AI-generated key takeaways
Share
& Export
Send highlights to Twitter, WhatsApp or export them to Notion, Readwise & more
AI-powered
podcast player
Listen to all your favourite podcasts with AI-powered features
Discover
highlights
Listen to the best highlights from the podcasts you love and dive into the full episode