Unique Approach 100% beat
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 {\n    public int[] addNegabinary(int[] arr1, int[] arr2) {\n\t    int max=Math.max(arr1.length,arr2.length);\n\t    int arr[]=new int [max+2];\n\t    int div=0;\n\t    for (int i=0;i<max;i++){\n\t    \t int index1=arr.length-i-1,index2=arr.length-i-2,index3=arr.length-i-3; \n\t    \t int sum=0;\n\t        int leng1=arr1.length-i-1;\n\t        int leng2=arr2.length-i-1;\n\t        if(leng1>=0){\n\t          sum+=arr1[leng1]; \n\t        }if(leng2>=0){\n\t          sum+=arr2[leng2]; \n\t        }\n\t        sum=sum+arr[arr.length-i-1];\n            if(sum % 2==0){\n\t       arr[index1]=0;\n\t       arr[index2]+=sum/2;\n\t       arr[index3]+=sum/2;\n            }\n            else{\n           arr[index1]=1;\n\t       arr[index2]+=sum/2;\n\t       arr[index3]+=sum/2;  \n            }\n\t    }\n\n        if(arr[1] % 2 == 0){\n            arr[0] = arr[0]+(arr[1] /2);\n            arr[1] = 0;\n            arr[0] = arr[0]%2;\n        }\n        else{\n            arr[0] = arr[0]+arr[1]/2;\n            arr[1] = 1;\n            arr[0] = arr[0] % 2; \n        }\n\t    for(int i=0;i<arr.length;i++){\n\t        if(arr[i]==1){\n\t         return Arrays.copyOfRange(arr,i,arr.length);\n\t        }\n\t  \n\t    }\n          return new int[]{0};\n\t}\n}\n\n```
['Bit Manipulation', 'Java']