C 0ms simple solution
Intuition\n\n\n# Approach\nCreated 2 new array and pass the values that problem wants.\nI have tried to use DMA for new arrays but problem did not accept.\nj ca
# Intuition\n\n\n# Approach\nCreated 2 new array and pass the values that problem wants.\nI have tried to use DMA for new arrays but problem did not accept.\nj cannot be negative, so I checked that too.\n\n\n# Complexity\n- Time complexity:\nO(n)\n\n- Space complexity:\nO(1)\n\n# Code\n```\nbool backspaceCompare(char * s, char * t){\n    int len1 = strlen(s);\n    int len2 = strlen(t);\n    char arr1[200] = {0};\n    char arr2[200] = {0};\n    int i = 0, j = 0;\n\n    for (i = 0; i < len1; i++) {\n        if (s[i] == \'#\') {\n            if (j > 0) {\n                arr1[j - 1] = 0;\n                j--;\n            }\n        } else {\n            arr1[j] = s[i];\n            j++;\n        }\n    }\n    arr1[j] = \'\\0\';\n    j = 0;\n\n    for (i = 0; i < len2; i++) {\n        if (t[i] == \'#\') {\n            if (j > 0) {\n                arr2[j - 1] = 0;\n                j--;\n            }\n        } else {\n            arr2[j] = t[i];\n            j++;\n        }\n    }\n    arr2[j] = \'\\0\';\n    \n    if (strcmp(arr1, arr2) == 0)\n        return true;\n    return false;\n}\n\n```
['C']