nice approach of counting the number of segments which will have odd and even number of 1's . there is actually an easier approach which aryanc explained using the prefix xor but it might be a little hard to think about the prefix xor which will make the counting much more simpler
nice approach of counting the number of segments which will have odd and even number of 1's .
there is actually an easier approach which aryanc explained using the prefix xor
but it might be a little hard to think about the prefix xor which will make the counting much more simpler
Bro thank you very much.!!
Change your mic bro. You have a great potential !.
Can you explain
solution of problem G?