Skip to main content
Data Structures and Algorithms for Fun

Data Structures and Algorithms for Fun

By Rithwik Gupta

The Data Structures and Algorithms for Fun podcast is run by Rithwik Gupta and consists of his talks for this Competitive Programming Club at IHS. He is currently in the USACO Gold Division (hoping to get Platinum soon!)

These lectures are made to be fun introductions into complex Computer Science Topics. Whatever I feel like talking about, I talking about (although what can be posted on this podcast is limited by the audio format).

If at any point you are stuck or don't understand anything, feel free to reach out to rithwikca2020@gmail.com and I will be happy to help!
Listen on SpotifySend voice message
Report content on Spotify
Currently playing episode

E01 - String Hashing Basics (Polynomial Hash, Birthday Paradox)

Data Structures and Algorithms for FunMay 08, 2023

00:00
20:04
E01 - String Hashing Basics (Polynomial Hash, Birthday Paradox)

E01 - String Hashing Basics (Polynomial Hash, Birthday Paradox)

String Hashing - One of my favorite concepts in Computer Science. It is the perfect blend between math, CS, and usefulness making it the topic of the first episode in this podcast. In this episode we talk about String Hashing using a polynomial hash as well as the Birthday Paradox and how it relates to hashing.


NOTE: Irvington High School's Competitive Programming Club hosted this lecture in-person, so some things may be unclear or there may be short pauses. The lecture was made to be listened to, but obviously looking at a presenter does much more.

May 08, 202320:04