Fast Fourier Transform, Algorithms, Pattern Matching, Convolution, Combination Sum.
another polynomial q(x) of same degree n-1 as follows: When we multiply p(x) with q(x), the resultant polynomial is of degree at-most 2n-2 and each co-efficient ‘c’ of the resultant polynomial is evaluated as follows: The coefficient of x^i in the multiplication is the summation of products of