AI-powered
podcast player
Listen to all your favourite podcasts with AI-powered features
#211: Classic CS problems in Python
Talk Python To Me
The Towers of Hano - How to Move a Single Disk
2min Snip
00:00
Summary
Transcript
Episode notes
The towers of hano is a difficult problem to solve by hand. The solution turns out to be, it's beautifully solved with recursion. And i don't think we can explain it wonderfully on the podcast, but i guess people will just have to take our word for it.
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