Fast Fourier Transform, Algorithms, Pattern Matching, Convolution, Combination Sum.
decimal point just in case there are rounding off errors. For e.g. m = 5 but c=4.9999996. The time complexity of the above approach is O((N+M)log(N+M)). Similarly, we can compute the convolution of one vector with another using FFT. Recall that convolution is a very important operation in deep