This question takes the factorisation of a polynomial $p(x)=q(x)r(x)$, where $p$ (and for my purpose here $q$ and $r$) have integer coefficients and asks if the maximum absolute value of the coefficients of $q,r$ can ever be greater than the maximum absolute value of the coefficients of $p$.
That is answered by a factor of $x^{105}-1$ which has a coefficient of absolute value $2$ and there are other examples of higher degree amongst the cyclotomic polynomials.
Also note that $x^4+1=(x^2+1)^2-2x^2$ has the factorisation $(x^2+\sqrt 2 x + 1)(x^2-\sqrt 2 x +1)$ which isn't integral, but does suggest that lower degree examples may exist.
But what is the lowest degree of an integer polynomial where $q,r$ have integer coefficients which are not bounded by the maximum absolute value of the original polynomial?
(apologies for the clumsy explanation - I couldn't find a neater way to ask what I wanted).
I supposed that @Ewan Delanoy's example were minimal, and on trying to prove that, I found the following very similar degree-3 factorization: $$X^3-X^2-X+1 = (X^2-2X+1)(X+1)$$ which must be minimal because at least one factor must have degree at least $2$ because the leading and trailing coeffs of the factors are bounded by those of the product.
Kudos go to Ewan, as without his example, I would not have constructed the other one.
P. S.: If you want a factorization into irreducibles, consider $$X^3+2X^2-2X-1 = (X^2+3X+1)(X-1)$$