Given a Binary string str and integer x , y. Return the no. of 1's occuring in between x and y indexes if the string can be repeated Infintely.
What would be the Fastest Approach for this problem? (Interview Question)
Given a Binary string str and integer x , y. Return the no. of 1's occuring in between x and y indexes if the string can be repeated Infintely.
Rev. | Lang. | By | When | Δ | Comment | |
---|---|---|---|---|---|---|
en2 | i_priyanshu | 2021-08-05 01:06:32 | 167 | |||
en1 | i_priyanshu | 2021-08-05 00:21:04 | 218 | Initial revision (published) |