Skip to content

Practice Adding Two Negabinary Numbers

Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.

Medium#1073
LeetCode Problem

Adding Two Negabinary Numbers

ArrayMath

Problem Statement

Given two numbers arr1 and arr2 in base -2, return the result of adding them together. Each number is given in array format:  as an array of 0s and 1s, from most significant bit to least significant bit.  For example, arr = [1,1,0,1] represents the number (-2)^3 + (-2)^2 + (-2)^0 = -3.  A number arr in array, format is also guaranteed to have no leading zeros: either arr == [0] or arr[0] == 1. Return the result of adding arr1 and arr2 in the same format: as an array of 0s and 1s with no leading zeros.

Source: Adding Two Negabinary Numbers on LeetCode. Use the original task for its coding environment and submissions.

Examples

# Example 1

Input
arr1 = [1,1,1,1,1], arr2 = [1,0,1]
Output
[1,0,0,0,0]

# Example 2

Input
arr1 = [0], arr2 = [0]
Output
[0]

# Example 3

Input
arr1 = [0], arr2 = [1]
Output
[1]

Constraints

1 <= arr1.length, arr2.length <= 1000
arr1[i] and arr2[i] are 0 or 1
arr1 and arr2 have no leading zeros

Related LeetCode Problems

Practice more problems similar to Adding Two Negabinary Numbers.

1 Two Sum Easy2 Add Two Numbers Medium4 Median of Two Sorted Arrays Hard7 Reverse Integer Medium9 Palindrome Number Easy
← Previous Flip Columns For Maximum Number of Equal RowsNext → Number of Submatrices That Sum to Target

Review your practice with PhantomCodeAI

After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.

Start Free