[Java] Simple DFS with check for adjacent characters, O(V+E) Solution - Longest Path With Different Adjacent Characters