This week's episode features David Harmeyer (SecondThread). We discuss his problem "String Concatenation" from Round 2 of Facebook Hacker Cup 2021. 00:00 - Introduction 00:42 - Problem Definition 05:10 - First Attempt (n = 25) 12:52 - Second Attempt (n = 50) 23:33 - Third Attempt (n = 1000) 34:30 - Irwin-Hall/Bates/Bernoulli Distributions 40:13 - Fourth Attempt (n = 2*10^5) 54:14 - Problem Origin Story

In this week's episode, the problems from the NAIPC 2019 contest are discussed in full with Lewin Gan. 00:00 - Welcome 01:34 - J: Subsequences in Substrings 07:44 - G: Intersecting Rectangles 12:11 - A: Piece of Cake 17:07 - M: XOR Sequences 26:44 - D: It's a Mod, Mod, Mod, Mod World 40:28 - B: Busy Board 49:01 - E: Monotony 55:23 - F: Heaps of Fun 01:04:00 - I: Cutting Strings 01:12:50 - L: Planes, Trains, but not Automobiles 01:21:24 - K: Knights of the Tarot Cards 01:31:32 - C: Cost of Living 01:36:38 - H: Rocket Powered Hovercraft

This week's episode sees the return of Scott Wu. We discuss the Venture Cup contest on Codeforces, the interest of venture capitalists in competitive programmers, and the relation of esports to competitive programming. We also discuss the problem "Group Projects" from Venture Cup. 00:00 - Welcome 00:42 - About Scott 02:05 - Streaming 26:48 - Venture Cup 39:15 - Group Projects

This week's episode will discuss the Codeforces problem "El Toll Caves" with the author Mikhail Tikhomirov. Mikhail is the also known by his handle Endagorion.

This week's episode is a discussion of the famous Polish Olympiad book "Looking for a Challenge". My guest discusses Polish contests, the history behind the book, and his problem "Termites" from the book.

In this week's episode, I'll be speaking to Errichto about educational streaming for competitive programming tasks. The discussion will start off with a discussion of his Codeforces problem Disjoint Triangles and related problems. After which we will discuss the benefits of educational streaming to programming contests and how to popularize competitive programming to a wider audience.

In this episode an intuitive maximum flow explanation is presented that avoids the typical formalization of maximum flow. 00:00 - Welcome 01:05 - Why Intuition? 02:40 - Sample Problem 07:21 - Balance of Degrees 09:08 - Second Sample Problem 11:35 - Parallel Edges 14:56 - Implementation of Ford-Fulkerson 22:40 - Next Episode Announcements Thanks to Rockett for the time links!

In this week's episode, I discuss an enumeration algorithm, fracturing search, to find the kth smallest spanning tree in a graph. 00:00 - Introduction 00:42 - Minimum Spanning Trees 01:45 - Kth Smallest Spanning Tree 03:21 - Fracturing Search 07:02 - Fracturing a Sequence 11:47 - The Algorithm By Hand 13:23 - Coding 15:54 - Coding the Search 22:10 - Coding createPartition 26:55 - Debugging and Testing 29:15 - Runtime Analysis 31:57 - Properties of Fracturing Search

In this week's episode, I will discuss the Codeforces problem Orchestra (http://codeforces.com/contest/627/problem/E) with Scott Wu.

In this week's episode, I will discuss the treap data structure. 00:00 - Welcome 04:04 - Random BST 08:05 - Goals 12:00 - Naive Construction 14:12 - Treap 17:01 - Rebalancing 21:15 - Insertions 25:35 - Split Operation 29:02 - Meld Operation 35:20 - Operating on Treap (Query) 40:45 - Delete Operation 42:28 - Rope Data Structure 46:40 - Implicit Indexing 50:24 - Rope Operations 56:15 - Reverse Operation 01:00:30 - "Select Upper Range" Operation 01:02:35 - Answering Questions and Next Episode Announcements Thanks to Rockett for the time links!

This week's episode features Lewin Gan and will cover his ICPC problem Rainbow Roads. You can find the problem statement here: https://open.kattis.com/problems/rainbowroads 01:20 - Lewin intro, problem description 07:11 - analysis of the problem, brute solution 09:36 - marking approach O(n^2), analyzing bad cases 13:56 - improving subproblem runtime 19:36 - alternative approaches 30:45 - coding Thank you to Mikhail Goncharov for the time links!

This week's episode will cover sparse tables and their relationship to the lowest common ancestor problem. I'll be discussing the so called "Euler tour of a tree" which is really just a tree traversal and explain how it helps with this formulation. 00:00 - Welcome 00:39 - Euler Tour of a Tree 04:12 - Tree Linearization 09:48 - LCA Algorithm w/ RMQ 10:46 - Sparse Table 12:09 - Pre-computation 13:56 - Queries 17:40 - Observations 20:06 - Implementation of LCA w/ RMQ 35:13 - Next Week Announcements Thanks to Rockett for the time links!

This week's episode will cover two methods for constructing a topological sort of a graph and Kosaraju's algorithm for finding strongly connected components.

This week's episode will cover the solution to the Polish Algorithmic Engagements problem Fibonacci Machine.

This week's episode will discuss an old Topcoder problem, Desert Wind.