Ahoy lads!

Does anyone by chance know when (if ever) this year's Facebook Hacker Cup is taking place? The registration page says "You are already registered for Hacker Cup 2020", but then the last post update on the page is from October 29th, 2019. It's strange, no schedule, no rules, no nothing...

So buckos, any information will be repaid their weight in gold. So now you might ponder "What's the weight of information?". Arrrrr!

You know FFT can be used to solve a lot of hard problems that require multiplying two polynomials, for example yesterday's hardest problem. Also many string matching problems can be transformed into an analogous polynomial problem and be solved using FFT.

Have you ever tried studying FFT but gave up because it was too mathy and difficult to understand?

Well, that won't happen anymore! Because a kind programmer who goes by the handle of RiAst decided to write a tutorial so that we, the ones who don't know much math, can finally understand and implement FFT. Here's the Ultimate Guide to understanding FFT once and for all!

Without furthed ado, here's the link to said glorious tutorial: Simple FFT Tutorial by RiAst