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

Constraints:

• $1$$\leq$ str1.length , str2.length $\leq$ $500$

• str1 and str2 consist of 0 or 1 characters only.

• Any string must not contain leading zeros except the string representing the binary form of $0$.

Let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.