Hi!
We’re continuing our deep dive into FFT! Check out the stream series announcement blog post for more details. Tomorrow, Thursday, June 19th, 2025 at 14:00 UTC, I will be streaming an intermediate-level lecture on my YouTube channel.
We'll explore how to make the basic FFT implementation more than 10x faster, how to solve more advanced problems with it, what NTT is, and plenty of other cool tricks along the way. This stream is mainly aimed at participants rated 1900–2000+ on Codeforces, but anyone interested is welcome to join.
Note: This isn’t a sequential lecture series. This particular stream is designed for people who already learned FFT a while ago, have solved a few problems with it, and are now looking to deepen their understanding and learn how to apply it to harder problems.
I already watched a stream on fft from one famous blogger from the main page, I hope this won't be worse!
Thanks for making this stream on an advanced topic.
Thanks to everyone who joined. Even if for a short while :) I enjoyed preparing this lecture a lot. I hope you learned something new today.
peltorator any plans for publihsing the solutions/editorials for your contests?
most of the problems are just educational applications of the algorithm or googlable problems from contests. so i don't think i'm going to do a separate editorial.
thanks"
why does KACTL's FFT implementation not pass A? Link
reading doubles is slow. read integers from the input.