Can you create a deterministic PDA for non-palindomes? Using non-determinism to create a PDA to recognize non-palindromes is easy.

My first instinct was to say yes, but it would be extremely complicated. After thinking about it, I don't think you could.
The language of palindromes isn't DCFL, see for example this question, which proves this for the closely related language of even length palindromes. Since DCFL are closed under complementation, it follows that your language is not DCFL.