question on distinct solutions to congruences

I had 5 problems to find all distinct solutions or show there are none. I did all 5 using a table of x values and just testing each, basically brute forcing them. I seem to be all over the place trying to figure them out in a more efficient manner. Any suggestions on how to do these with a good method would be greatly appreciated:

1.
x^2 + x + 3 = 0(mod 5)

2.
x^2 + 2x + 3 = 0(mod 5)

3.
x^2 = 4(mod 15)

4.
x^2 + x + 4 = 0(mod 8)

5.
x^3 + 2x^2 + 5x + 6 = 0(mod 11)

As I said, I already know the answers from brute forcing and checking the back of the book, but I can not seem to find a consistent, better method, especially for number 5, and this is something I really want to understand how to do.

For 1, I actually did this similar by changing it to be x^2 + x - 2 to get factors of (x+2)(x-1), resulting in the same answer.

Attempting to use the same method on successive problems is why I discarded it as possibly not the best way. Number 3 is the perfect example. You got the +/-2 part, but there is an additional answer of +/-7 that works as well. I ended up working the problem with mod 3 and mod 5 and brute forcing 3 and 5 values respectively. Then I took the common values mod 15 and tested all of them to see which ones worked. Basically a more efficient brute force technique, but still not very efficient as the mod value increases.

For number 4, do you just have to basically know which numbers to change to make it factor or is there a way to help you choose?

Okay, so it looks like you just have to play around with it until you recognize a factorable equation? I brute forced all 11 possible incongruent numbers and found that only x congruent 3 (mod 11) worked. Your method is obviously better, but what if I don't immediately recognize the equation that you saw?