Python solution (base negative-two conversion)
The tricky part might be how to convert a number to base negative-two representation.\n\nclass Solution:\n    def addNegabinary(self, arr1, arr2):\n        n = 
The tricky part might be how to convert a number to base negative-two representation.\n```\nclass Solution:\n    def addNegabinary(self, arr1, arr2):\n        n = (sum(pow(-2, i) for i, v in enumerate(arr1[::-1]) if v) +\n             sum(pow(-2, i) for i, v in enumerate(arr2[::-1]) if v))\n        res = self.get_base_negative_two(n)\n        return res if res else [0]\n     \n        \n    def get_base_negative_two(self, n):\n        """\n        q, r = divmod(a, b): here a, b can be any non-complex number with abs(b) nonzero. The return r has the same sign as b and 0 <= abs(r) < abs(b).\n        A special case is when a, b are positive integers, then q, r are the usual\n        quotient and remainder.\n        \n        """\n        res = []\n        while n:\n            n, rem = divmod(n, -2)\n            print(n, rem)\n            if rem < 0:\n                n += 1\n            res.append(abs(rem))\n        res.reverse()\n        return res\n```
[]