Well, firstly we have to split it up into two directions since it is iff. I'll push in you in the correct direction for both ways.
The first important thing to notice is that $\sum_{k=0}^{\infty} (1 - p_n)p_n^k = 1$ so we know with probability $1$ that $X_n = k$ for some $k$.
"$\Rightarrow$" This time we're assuming $X_n \rightarrow 0$ in probability. This means that for any $\epsilon$, $ Pr(X_n \geq \epsilon) \rightarrow 0$ So consider the specific case take $\epsilon = \frac{1}{2}$ or anything less than one. Then we know that $ Pr(X_n \geq \frac{1}{2}) \rightarrow 0$ So what can we say about $Pr(X_n = k)$ for $k\geq1$ as $n$ gets very large? and in turn what can we then say about $p_n$?
"$\Leftarrow$" For this one we're assuming $p_n \rightarrow 0$ and we have to show convergence in probability. So fix $\epsilon > 0$ and what we need to show is that $Pr(X_n \geq \epsilon)\rightarrow 0.$ Let $M$ be the first one that is greater than $\epsilon$ (note that $M > 0$) then the probability that $X_n \geq \epsilon$ is the same as the probability that $X_n = a$ for some integer $a \geq M$.
So since $p_n \rightarrow 0$ we can choose $N$ large so that for $n$ bigger than $N$, $p_n < \frac{1}{r}$. In this case for large $n$ we have $ Pr(X_n = k) \leq \frac{1}{r^k}.$ So then what can you say about the probability that $X_n = a$ for some $a \geq M$? In particular if you choose appropriately large $r$ you should be able to conclude exactly what we want.