Beats 100% || Easiest Approach using Functions
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\nO(n)\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nbool backspaceCompare(char* s, char* t) {\n    int s_len = strlen(s);\n    int t_len = strlen(t);\n    int processString(char* str) {\n        int i, stackIndex = 0;\n        for (i = 0; i < strlen(str); i++) {\n            if (str[i] != \'#\') {\n                str[stackIndex++] = str[i];\n            } \n            else if (stackIndex > 0) {\n                stackIndex--;\n            }\n        }\n        str[stackIndex] = \'\\0\';\n        return stackIndex;\n    }\n    int sIndex = processString(s);\n    int tIndex = processString(t);\n    if (sIndex != tIndex) {\n        return false;\n    }\n    for (int i = 0; i < sIndex; i++) {\n        if (s[i] != t[i]) {\n            return false;\n        }\n    }\n    return true;\n}\n```
['C']