How do you find the smallest integer? $$\begin{align}
(x-1) \;\text{mod}\; 11 &= 3x\; \text{mod}\; 11\\
11&\lvert(3x-(x-1)) \\
11&\lvert2x+1\\
x &= 5?\\
\end{align}
$$
$$
\begin{align}
(a-b)\; \text{mod}\; 5 &= (a+b)\;\text{mod}\;5\\
5&\lvert a+b-a+b\\
5&\lvert2b\\
b &= 5/2\\
a &= \text{any integer}
\end{align}
$$
I don't know how to solve this type of problem. Can you tell me what I have to do generally step-by-step?

There are several ways; for example look at Diophantine divisors, but now I will write it ;
$ax\equiv b\;(mod\;m)\Longleftrightarrow (a,m)=d|b$ and its answers are every number in congreuent classes by modulo m like $(\frac{a}{d})^{*}(\frac{b}{d})+k\frac{m}{d}$ where $0\leq k\leq d-1$ and $(\frac{a}{d})^{*}$ in Möbius inversion of $\frac{a}{d}$ in mod $\frac{m}{d}$
When $(a,m)=d|b$, we can say $(\frac{a}{d},\frac{m}{d})=1$ and from Euler theorem that $a^{\phi(m)}\equiv 1\;(mod\;m)\Longrightarrow a^{\phi(\frac{m}{d})-1}a\equiv 1\;(mod\;\frac{m}{d})$ so $a^{\phi(\frac{m}{d} )-1}$ is one Möbius inversion of $\frac{a}{d}$ in mod $\frac{m}{d}$ . By finding Möbius inversion, and replacing in  $(\frac{a}{d})^{*}(\frac{b}{d})+k\frac{m}{d}$, then every number in congreuent classes by modulo m that is found, are the answers you need.
For example let calculate your first question;
$x-1\equiv 3x\;(mod\;11)\Longleftrightarrow 2x\equiv -1\;(mod\;11)$
because $(2,11)=1|-1$ so it has answer. Here $d$ is $1$.
At first calculate Möbius inversion of $2$ in mod $11$, (note that $d=1$!).
$2^{*}=2^{\phi(11)-1}=2^{10-1}=2^{9}=512\equiv 6\;(mod\;11)$
so $2^{*}=6$ now because $d-1=0$ we only put $k=0$ then answers is 
$\{x\in\mathbb{Z}|[x]_{11}=[6(-1)+(0)11]_{11}\}=$
$\{x\in\mathbb{Z}|[x]_{11}=[-6]_{11}\}=$
$\{x\in\mathbb{Z}|[x]_{11}=[5]_{11}\}=$
$\{11n+5|n\in\mathbb{Z}\}$ .
