BEST C++ SOLUTION WITH 7MS OF RUNTIME !
\n# Code\n\nclass Solution {\n public:\n  vector<int> addNegabinary(vector<int>& arr1, vector<int>& arr2) {\n    deque<int> ans;\n    int carry = 0;\n    int i 
\n# Code\n```\nclass Solution {\n public:\n  vector<int> addNegabinary(vector<int>& arr1, vector<int>& arr2) {\n    deque<int> ans;\n    int carry = 0;\n    int i = arr1.size() - 1;\n    int j = arr2.size() - 1;\n\n    while (carry || i >= 0 || j >= 0) {\n      if (i >= 0)\n        carry += arr1[i--];\n      if (j >= 0)\n        carry += arr2[j--];\n      ans.push_front(carry & 1);\n      carry = -(carry >> 1);\n    }\n\n    while (ans.size() > 1 && ans.front() == 0)\n      ans.pop_front();\n\n    return {ans.begin(), ans.end()};\n  }\n};\n```
['C++']