Fast Fourier Transform, Algorithms, Pattern Matching, Convolution, Combination Sum.
knows how to do multiplication. So what’s the big deal about it when it comes to FFT? Lets revisit how would you do multiplication of 2 integers, for e.g. 1234 and 6789 Multiply the 1st integer with each digit of the 2nd integer (starting from rightmost digit), left shift the multiplication result