Episode 116: Max Gap Count in C++23
Algorithms + Data Structures = Programs
00:00
The Next Step Algorithm Is Um
The algorithm uses a list to find the locations of gaps. The only downside with that is that you need some dynamic storage for it. It's very interesting but now you've completely broken my whole eureka moment or not eureka moments, he says. "I think in most cases it's going to be uh a small list"
Transcript
Play full episode
