Claim: if $|z|=\frac1e$ but $z\ne\frac1e$, then the series converges.
Write $z=e^{i\theta-1}$. We can show the claim using Dirichlet's test, with $a_n = n^n/(e^nn!)$ and $b_n = e^{in\theta}$, if we can prove that $\{n^n/(e^nn!)\}$ is a decreasing sequence whose limit equals $0$. (The geometric series formula for $\sum_{n=1}^N e^{in\theta}$ shows that the boundedness condition is satisfied.) Equivalently, one needs to show that
$$
\bigg\{\log \frac{e^nn!}{n^n} \bigg\} = \bigg\{ \sum_{k=1}^n \log k - (n \log n - n) \bigg\}
$$
is increasing and tends to $\infty$. This can be done by looking at the difference sequence
\begin{multline*}
\bigg( \sum_{k=1}^n \log k - (n \log n - n) \bigg) - \bigg( \sum_{k=1}^{n-1} \log k - ((n-1) \log (n-1) - (n-1)) \bigg) \\
= \log n - \int_{n-1}^n \log x\,dx.
\end{multline*}
That difference is the area of the almost triangle-shaped region above $y=\log x$ and $y=\log n$ between $n-1\le x\le n$; it is certainly greater than the area of the rectangle with upper-left corner $(n-1,\log n)$ and lower-right corner $(n-\frac12,\log(n-\frac12))$, which one can show (using the mean value theorem) is greater than a constant times $\frac1n$. This lower bound for the difference sequence forces the original sequence to increase to infinity by comparison with the harmonic series.
The original series diverges when $z=\frac1e$, but that's difficult to motivate without knowing Stirling's approximation. Nevertheless you can show, using a similar method, that
$$
\frac{n^n}{e^nn!}\cdot n
$$
increases to infinity, which is enough to show that $\sum \frac{n^n}{e^nn!}$ diverges.