Skip to content
Python Hash Sets Explained and Demonstrated - Computerphile episode artwork

EPISODE · Oct 11, 2026 · 24 MIN

Python Hash Sets Explained and Demonstrated - Computerphile

from Computerphile · host Computerphile

Featuring Mike Pound. Jane Street skyscraper puzzle (and info on the AMP program) at https://bit.ly/computerphile-amp --- More below ↓↓↓Hash Sets in Python work a little bit like the index of a book, giving you a shortcut to looking for a value in a list. Dr Mike Pound explains how they work and demos with some code. #Python #HashSet #Code #Computerphile Jane Street’s Academy of Math and Programming is now accepting applications for their summer 2024 program, which will run from June 29th-August 2nd in NYC... Or you can just check out the puzzle for fun too - https://bit.ly/computerphile-amp (episode sponsor)https://www.facebook.com/computerphilehttps://twitter.com/computer_phileThis video was filmed and edited by Sean Riley.Computer Science at the University of Nottingham: https://bit.ly/nottscomputerComputerphile is a sister project to Brady Haran's Numberphile. More at https://www.bradyharanblog.comThank you to Jane Street for their support of this channel. Learn more: https://www.janestreet.com Learn more about your ad choices. Visit megaphone.fm/adchoices

Episode metadata supplied by the publisher feed · Published Oct 11, 2026

Embed this episode

Ready to play

Python Hash Sets Explained and Demonstrated - Computerphile

0:00 24:23

No transcript for this episode yet

We transcribe on demand. Request one and we'll notify you when it's ready — usually under 10 minutes.

No similar episodes found.

No similar podcasts found.

Frequently Asked Questions

How long is this episode of Computerphile?

This episode is 24 minutes long.

When was this Computerphile episode published?

This episode was published on October 11, 2026.

Can I download this Computerphile episode?

Yes. Use the download control on the episode player to save the publisher-provided media file.
URL copied to clipboard!