Adding Two Negabinary Numbers - Part 1 - Solution - leetcode - medium difficulty

Come with me on my mental process of how to figure out coding problems during my interview preparation.

Problem Description:
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.

[robolexa]

Thanks for putting up this video, usually many people struggle at this point that how should we really think about a problem.... & you included all what you tried which gives clear idea about what wouldn't work & why it won't.... Thanks!!

[vishalmishra]

It would be so helpful if you could make shorter videos.