Notice that $10 \equiv -1 \pmod{11}$. Thus $$10^n \equiv \begin{cases}1 & n \text{ even} \\ -1 &  n \text{ odd}\end{cases} \pmod{11}$$ Then use this fact to prove that a number is congruent to the alternating sum of its digits $\pmod{11}$.