According to Edwards, in his 1887 Fundamental Theorem of General Arithmetic Kronecker was working with polynomials with integer coefficients. He proclaimed, however, that "the so-called fundamental theorem of algebra is replaced" with the title theorem, and that he "put foundations of algebra in an entirely new form". Indeed the proof applies much more generally, providing that any polynomial can be split into linear factors in some extension of its field of coefficients. This is now known as the Kronecker's theorem, or the splitting field theorem, and that the proof does not depend on any analytic properties of $\mathbb C$ held great appeal in Kronecker's eyes. He names as an inspiration his "sharp critique of the method of defining quantities that began with Heine", a stand in for transcendental arguments of Cantor, Dedekind and Weierstrass.
Kronecker did not however come up with the modern quotient ring construction, being an early constructivist he had philosophical objections to Dedekind's ideals themselves, and even offered divisors as an alternative to them earlier. Instead, he formalized a more "explicit" construction of Galois, who called it "adjoining a root", arguably completing the long process of proving the FTA "algebraically". Gauss already pointed out the circularity of reasoning that roots are elements of $\mathbb C$ in Euler's and Lagrange's attempted proofs of FTA. They needed to perform computations with roots, which required treating them as elements of $\mathbb C$, in the course of proving that they are elements of $\mathbb C$. One either has to presuppose that the roots exist, which is circular, or to use continuity arguments to prove existence, which is "non-constructive".
Galois still tacitly assumed that computations with roots were valid, but he usually expressed the adjoined roots as polynomials with rational coefficients in a new indeterminate $t$, specifying $t$ to be a root of a known irreducible polynomial. Kronecker called this construction "the precious Galois principle", and proved that such presentation is always possible for polynomials with integer coefficients. Namely, given a polynomial $f(x)$ it is possible to find a polynomial $G(t)$ such that adjoining its root allows to express all roots of $f(x)$ constructively as polynomials in $t$. Thus, adjoining a single element splits $f(x)$ into linear factors, and computations with roots become justified.