Let $\{W_t\}_{t\ge 0}$ be a standard 2D Brownian motion starting at $(1,1)\in\Bbb R^2$. What's the probability that $W_t$ hits the positive half of $x$-axis before it hits the negative part?
There are standard "tricks" to solve similar problems in 1D. For example, if $B_t$ is a standard 1D BM starting at 0 and we want to compute $\Bbb P(B_t\,\text{hits 3 before hitting -5})$, then we let $\tau=\inf\{t\ge 0\mid B_t=3\vee B_t=-5\}$ and since $\tau$ is a.s. bounded we have, by the optional stopping theorem, that $$0=B_0=\Bbb E(B_\tau)=\Bbb E(B_\tau I(B_\tau = 3))+\Bbb E(B_\tau I(B_\tau = -5))=3\Bbb P(B_\tau=3)-5(1-\Bbb P(B_\tau = 3)).$$ Simple as above. We don't have to explicitly work out the distribution or expectation of $\tau$ at all.
Now back to the 2D case. Do similar elegant tricks exist? If not, what'd be the quickest possible way to solve it? (For what it's worth, this problem was asked in a Morgan Stanley quant interview, so I expect there to be at least one trick that can solve it in no more than a few minutes.)
Here is a complement to the answer posted by @saz that does not require an explicit use of the distribution of the stopping time. I will just use the notation in that answer. We want to compute $P\{B_{\tau}^1 \geq -1\}$. Since $B^1$ and $\tau$ are independent, we can write
$$P\{B_{\tau}^1 \leq -1\} = \int_{t\geq 0} P\{B_t^1 \leq -1\}f_{\tau}(t)\,dt$$ where $f_{\tau}(t)$ is the density of $\tau$. By the reflection principle,
$$P\{\tau \leq t\} = P\{N^2_t \leq -1\} = P\{M^2_t \geq 1\} = P\{\lvert B^2_t\rvert \geq 1\} = 2P\{B^2_t \leq -1\} = 2P\{B^1_t \leq -1\}$$ where $N^2$ and $M^2$ are the running minimum and the running maximum of $B^2$, respectively.
We can then write $f_{\tau}(t)\,dt = 2 dP\{B^1_t \leq -1\}$. Hence, the integral we want to evaluate becomes
$$2\int_{t\geq 0} P\{B_t^1 \leq -1\}dP\{B^1_t \leq -1\} = \left. P\{B_t^1 \leq -1\}^2\right|_{t=0}^{t=\infty} = \lim_{t\to\infty} P\left\{B_1^1 \leq -\frac{1}{\sqrt{t}}\right\}^2 = P\left\{B_1^1 \leq 0\right\}^2 = \frac{1}{4}$$
The last but one step uses dominated convergence.