Given a list of values z0, z1, ..., zn-1 (possibly with repetitions), show how to find the coefficients of a polynomial P(x) of degree-bound n + 1 that has zeros only at z0, z1, ..., zn-1 (possibly with repetitions). Try to find a solution or algorithm that can run in time O(nlg2n).
What I've come up with:
I know that P(x) has a zero at zj iff P(x) is a multiple of (x - zj).
Therefore, we can check if P(x) mod (x - zj) = 0
But I'm not sure how to get that runtime or how to proceed further.
What about $p(x)=\prod_{k=0}^{n-1}(X-z_k)$? Use divide-and-conquer and FFT based polynomial multiplication (Schönhage-Strassen) for a fast construction of the product.