AI-powered
podcast player
Listen to all your favourite podcasts with AI-powered features
2min chapter
Fold and Scan
The Array Cast
How to Solve a Cadain Algorithm With a Single Fold Primitive
Cadain's algorithm is alternatively known as the maximum sub array some problem. It basically means if you're given a list of numbers positive and negative it's important that there's some negatives. There are two ways to solve it: dynamic programming or using binary operations. The reason I wanted to know more about the folds in general but also could I solve cadain's algorithm with a single fold primitive?
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