It should be obvious that if $n > 0$ then $\frac {n+3}{2n+3} < 1$ and can't be an integer. (As $2n+3,n+3$ are both positive we'd have $0 < \frac {n+3}{2n+3} < 1$).
So for $n \le 0$.... Well, it's pretty obvious if $n =0$ we have $k =\frac {n+3}{2n+3} =1$.
And if $n< 0$ .....
Well.... $\frac {n+3}{2n+3} = \pm \frac {|n+3|}{|2n+3|}$ and for that to be an integer we need $|n+3| \ge |2n+3|$ which should strike us as very unlikely as coeficient of $2$ will dominate for large values of $|n|$.
That is to say. If $n < 0$ and $|n|$ is large enough so that both $n+3$ and $2n+3$ are both negative (that is if $n < -3$ or $|n| > 3$) we would have
$\frac {n+3}{2n+3} =\frac {|n+3|}{|2n+3|}=\frac{-n-3}{-2n-3}= \frac {|n|-3}{2|n| - 3}$. But as $0< |n|-3< 2|n|-3$ and both terms are positive that means $0 <\frac{|n|-3}{2|n|-3} < 1$ and it can't be an integer.
So $n > 0$ is impossible and $n<-3$ is impossible.
So we have to test for $n =-3,-2,-1,0$. Which....are easy to see yield
$k = \frac {-3+3}{2\cdot(-3)+3}=0; k = \frac {-2+3}{2(-2)+3}=-1; k=\frac {-1+3}{-2+3}=2; k=\frac {0+3}{2\cdot 0 + 3} = 1$.