Funny String Java Solution
Bug

The main loop starts at i = 2. That is, s.charAt(1) - s.charAt(0) is never attended to. Suspicious, isn't it?
Naming

A name comp (and comp2) presumes that it carries some information about comparison. It obviously doesn't. diff and rdiff sound better.
Algorithm

Reversal of the string just wastes time. You may work the same string from both directions simultaneously:

for (int i = 1; i &lt; s.length(); ++i) {
    diff = s.charAt(i) - s.charAt(i - 1);
    rdiff = s.charAt(s.length() - 1 - i) - s.charAt(s.length() - 1 - (i-1));
    ...

Returning the comparison result is an anti-pattern.

return stillEq;


achieves the same result as

if (stillEq)
    return true;
else
    return false;


in a much cleaner way.
If you insist on reversing a string, better come up with an iterative method. Java cannot eliminate tail recursion.