2505. Bitwise OR of All Subsequence Sums - Week 5/5 Leetcode April Challenge

Larry solves and analyzes this Leetcode problem as both an interviewer and an interviewee. This is a live recording of a real engineer solving a problem live - no cuts or edits!
Problem: leetcode.com/problems/bitwise...
Twitch: / larryny
Discord: / discord
Instagram: / larrysomewhere
#leetcode #coding #programming

[@Algorithmist]

Any ors about this problem?

[@automatic525]

Can someone explain why we add half of the value from previous index?

[@mingzhezou5628]

Because it is in binary form. As a comparison, in decimal add we learnt, the carry forward will be f[i] = f[i - 1] // 10

[@automatic525]

@@mingzhezou5628 Ah I see. Got it. Thank you!