Not a clear solution C#
\n# Complexity\n- Time complexity: O(max(n, m))\n Add your time complexity here, e.g. O(n) \n\n- Space complexity: O(max(n, m)\n Add your space complexity here,
\n# Complexity\n- Time complexity: O(max(n, m))\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity: O(max(n, m)\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\npublic class Solution {\n    public int[] AddNegabinary(int[] arr1, int[] arr2) {\n        List<int> result = new List<int>();\n        int carry = 0;\n        int i = arr1.Length - 1, j = arr2.Length - 1;\n\n        while (i >= 0 || j >= 0 || carry != 0) \n        {\n            int x = (i >= 0) ? arr1[i] : 0;\n            int y = (j >= 0) ? arr2[j] : 0;\n\n            int sum = x + y + carry;\n            result.Add(sum & 1); \n            carry = -(sum >> 1); \n\n            i--;\n            j--;\n        }\n\n        while (result.Count > 1 && result[result.Count - 1] == 0) \n        {\n            result.RemoveAt(result.Count - 1);\n        }\n\n        result.Reverse();\n        return result.ToArray();\n    }\n}\n```\n![89f26eaf70fa927a79d4793441425859.jpg](https://assets.leetcode.com/users/images/7fb39905-a61c-4b16-9fd2-8bc8747d2b66_1720178691.860781.jpeg)\n
['Array', 'Math', 'C#']