Solution in C++
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:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\npublic:\n\tvector<int> addNegabinary(vector<int>& arr1, vector<int>& arr2) \n    {\n\t\treverse(arr1.begin(),arr1.end());\n\t\treverse(arr2.begin(),arr2.end());\n\t\tint len(max(arr1.size(),arr2.size()));\n\t\tint carry=0;\n\t\tvector<int> ans;\n\t\tfor(int i=0;i<len+2;i++)\n        {\n\t\t\tint cur1=i<arr1.size() ? arr1[i]:0;\n\t\t\tint cur2=i<arr2.size() ? arr2[i]:0;\n\t\t\tint sum=cur1+cur2+carry;\n\t\t\tint r=sum%(-2);\n\t\t\tcarry=sum/(-2);\n\t\t\tif(r<0)\n            {\n\t\t\t\tcarry++;\n\t\t\t\tr+=abs(-2);\n\t\t\t}          \n\t\t\tans.push_back(r);\n\t\t}\n\t\twhile(ans.size()>1 && ans.back()==0)\n        {\n\t\t\tans.pop_back();\n\t\t}\n\t\treverse(ans.begin(),ans.end());\n\t\treturn ans;\n\t}\n};\n```
['C++']