The $n$ nodes $x_0, \ldots, x_{j-1}, x_{j+1}, \ldots, x_n$ must be
roots of $L_j,$ and the degree of $L_j$ is at most $n$, so
$$L_\color{var(--emphColor)}{j}(x) = c(x - x_0)\cdots(x - x_{\color{var(--emphColor)}{j-1}})(x-x_{\color{var(--emphColor)}{j+1}})\cdots(x-x_n)$$
for some constant $c$.
The requirement $L_\color{var(--emphColor)}{j}(x_\color{var(--emphColor)}{j}) = 1$ implies that
$$c = {1 \over (x_\color{var(--emphColor)}{j} - x_0)\cdots(x_\color{var(--emphColor)}{j} - x_{j-1})(x_\color{var(--emphColor)}{j}-x_{j+1})\cdots(x_j-x_n)}.$$
Combining results, we obtain
$$L_j(x) = \prod_{k \neq j \\ k = 0}^n{x - x_k \over x_j - x_k}.$$
The polynomials $L_j$ really do exist! We call $L_j$ the
$j$th degree $n$
Lagrange basis polynomial.