best 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      \n       int[] arr = new int[arr1.length>arr2.length?arr1.length+2:arr2.length+2];\n\t\tint len = (arr1.length<arr2.length?arr1.length:arr2.length) - 1;\n\n\t\t     for(int i = 0; i<arr.length-2; i++){\n\t\t        int sum = 0;\n\t\t         if((arr1.length-i-1)>= 0){\n\t\t        sum = sum + arr1[arr1.length-i-1];\n\t\t         } \n\t\t         if(arr2.length-i-1 >= 0){\n\t\t        sum = sum + arr2[arr2.length-1-i];\n\t\t         }\n\t\t         \n\t\t         int newArr = sum +  arr[arr.length-1-i];\n\t\t        \n\t\t         if(newArr % 2 ==0){\n\t\t             arr[arr.length-1-i] =  0;\n\t\t             arr[arr.length-2-i] =  arr[arr.length-2-i]+ (newArr/2);\n\t\t            arr[arr.length-3-i] =  arr[arr.length-3-i] + (newArr/ 2);\n\t\t         }\n\t\t         else{\n\t\t              arr[arr.length-1-i] =  1;\n\t\t              arr[arr.length-2-i] =  arr[arr.length-2-i]+ (newArr/2);\n\t\t\t           arr[arr.length-3-i] =  arr[arr.length-3-i] +(newArr/2);\n\t\t         }\n\t\t     }\n\t\t    if(arr[1]%2 == 0) {\n\t\t    \t arr[0] =  arr[0]+ arr[1] /2;\n\t\t    \t arr[1] =  0;\n\t             arr[0] = arr[0]%2;\n\t\t     }\n\t\t     else if(arr[1]%2 !=0){\n\t\t    \t arr[0] = arr[0] + arr[1]/2;\n\t\t    \t arr[1] = 1;\n\t\t    \t arr[0] = arr[0] % 2;\n\t\t     }\n\t\t     for(int  i = 0;i<arr.length; i++) {\n\t\t    \t if(arr[i] == 1) {\n\t\t    \t\t return Arrays.copyOfRange(arr, i, arr.length);\n\t\t    \t }\n\t\t     }\n\t\t     return new int[]{0};\n\t\t    }\n\t\t\n\t}\n\n```
['Bit Manipulation', 'Java']