What would be the Fastest Approach for this problem? (Interview Question)

Revision en2, by i_priyanshu, 2021-08-05 01:06:32

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.

For Example — Str = "11010" int x = 7; int y = 23; return the count of all 1's between 7 and 23. if the String can be concatenated to itself infinite times.

Tags #interview, #two pointers


  Rev. Lang. By When Δ Comment
en2 English i_priyanshu 2021-08-05 01:06:32 167
en1 English i_priyanshu 2021-08-05 00:21:04 218 Initial revision (published)