QUERY BITS segment tree problem

#1

How to approach this problem,will it use lazy propagation?

#2

Yeah, you need to use lazy propagation since it involves range updates. You can store 0 or 1 in lazy tree.
And store number formed in the nodes.

#3

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.