Add Binary

Solution Approach

Was this helpful?

Easy•bits•Expected: O(max(m, n)) where m and n are lengths of a and b time, O(1) modifying input string in place space

bit-manipulationmath

Problem

Given two binary strings a and b, return their sum as a binary string.

Constraints: 1 <= a.length, b.length <= 10^4. a and b consist only of '0' or '1' characters. Each string does not contain leading zeros except for the zero itself.

Example 1:

Input: a = "11", b = "1"
Output: "100"

Example 2:

Input: a = "1010", b = "1011"
Output: "10101"

Reference solution unlocks after your first submission

Language: