A crude but surprisingly effective way to solve for the rate parameter $\lambda$ is to set up a recursion. Given $$\Pr[X \le 2] = e^{-\lambda}(1 + \lambda + \lambda^2/2) = 0.7,$$ we may write this as $$\lambda = \log \frac{1 + \lambda + \lambda^2/2}{0.7}$$ which induces a recursion relation $$\lambda_{n+1} = \log \frac{1 + \lambda_n + \lambda^2_n/2}{0.7}.$$ Then with an initial guess, say $\lambda_0 = 1$, it is relatively simple to implement this recursion in a typical pocket calculator; e.g. first entering 1, then entering ln((1 + Ans + Ans^2/2)/0.7), then repeating this entry by pressing =. By the thirtieth iterate, we get at least six digits of precision, sufficient to compute $\Pr[X < 2]$.
We can improve upon the initial guess by noting that for $\lambda = 1$, $\Pr[X \le 2] \approx 0.91$, which is too large; but $\lambda = 2$ gives $\Pr[X \le 2] \approx 0.676$, much closer but on the other side of $0.7$; so we know that the precise value must be slightly less than $2$, say $\lambda_0 = 1.9$. This saves us about $15$ iterations.