67. Add Binary | JavaScript | O(n) TC | O(1) SC | LeetCode Daily Challenge

[@BaoTran-wv3nn]

I think the space complexity will be O(n) because you store the result as a string which can have maximum length of n+1, n is a length of the longest string

[@LeetCodeWithMonu]

Connection Info: LeetCode: leetcode.com/monuchaudhary1/ LinkedIn: www.linkedin.com/in/monu-chaudhary/ Instagram: instagram.com/monu.chaudhary9/

[@HappyBoaSnake-xp8vf]

You were saying (sum % 2) will be 1 but how, it will be 0 na ? and

[@weallgonnamake]

You don't use m and n that's assigned as length?

[@LeetCodeWithMonu]

Good catch... you could use it in the for loop.