The random walk position at step $n+1$ is given by $S_{n+1}=S_n+1$ with probability $1-p$ and $S_{n+1}=-S_n$ with probability $p$. For the initial position consider $P(S_0=0)=p, P(S_0=1)=1-p$. We have $\mathbb{E}(S_n^2)=O(n)$ for any $p\in(0,1)$. It would be enough for my purposes to show $\mathbb{E}(|S_n|)=O(n^{1/2})$, but I think that's more difficult.
I was not able to prove this, only verified numerically. Intuitively this is because we have a chance of loosing steps in the right direction after inversion, since for example, $S_{100}=100$ and the event with probability $p$ happens we start loosing $|S_n|$ with -100,-99,...
The motivation to consider this is that the absolute value of $S_n$ gives the number $|n_1|$ of $a$'s in a random product of $a$'s and $b's$ with $a^k b a^k=b, k\in \mathbb{N}$, $b^2=1$. In this product $a$ happens with probability $1-p$ and $b$ with probability $p$. With the relations we can write an n-th product $A^{(n)}= a^{n_1}b^{n_2}$. This appears in the theory of Lyapunov exponents by considering $a$ the matrix diag$(2,1/2)$ and $b$ a rotation by $\frac{\pi}{4}$ ($b^2=-1$ in this case, but we're interested in the norm).