Leetcode 3549. Multiply Two Polynomials

Given two polynomials (e.g., as coefficient arrays or sparse term lists), compute the coefficients of their product polynomial. The core challenge is performing the convolution efficiently for large degrees — typically requiring fast convolution techniques (FFT/NTT or Karatsuba/divide-and-conquer) and careful handling of numerical precision or modular arithmetic.