Let $A=\mathbb{1}-I \in \{0,1\}^{n \times n}$, the matrix having 0 in the diagonal and 1 everywhere else. To compute the eigenvalues I tried to compute the characteristic polynomial using recursion, but this turns out to be quite complicated, I think.
Is there some easier approach for finding the eigenvalues of such easy matrices? Maybe some guessing strategy?
And how, if we only have guessed some eigenvalues, do we know the (geometric) multiplicity of it?
Are there some easy tricks?
Observe that the rank of the matrix $\mathbb{1}$ is $1$. Therefore, it has one nonzero eigenvalue and $n-1$ zero eigenvalues. The nonzero eigenvalue is $n$ corresponding to the vector of ones. The remaining eigenvector corresponds to $e_1-e_i$ (for $i=2,\dots,n$).
Now, use @5xum 's answer to compute the eigenvalues.