Java Solution, 0 ms, Beats 100%
Java Code\n\nclass Solution {\n    public boolean backspaceCompare(String s, String t) {\n        int i = s.length() - 1;\n        int j = t.length() - 1;\n    
# Java Code\n```\nclass Solution {\n    public boolean backspaceCompare(String s, String t) {\n        int i = s.length() - 1;\n        int j = t.length() - 1;\n        int skipS = 0;\n        int skipT = 0;\n        while (i >= 0 || j >= 0) {\n            while (i >= 0) {\n                if (s.charAt(i) == \'#\') {\n                    skipS++;\n                    i--;\n                } else if (skipS > 0) {\n                    skipS--;\n                    i--;\n                } else {\n                    break;\n                }\n            }\n            while (j >= 0) {\n                if (t.charAt(j) == \'#\') {\n                    skipT++;\n                    j--;\n                } else if (skipT > 0) {\n                    skipT--;\n                    j--;\n                } else {\n                    break;\n                }\n            }\n            if (i >= 0 && j >= 0 && s.charAt(i) != t.charAt(j)) {\n                return false;\n            }\n            if ((i >= 0) != (j >= 0)) {\n                return false;\n            }\n            i--;\n            j--;\n        }\n        return true;\n    }\n}\n```
['Two Pointers', 'String', 'Stack', 'Simulation', 'Java']