editorial for BINSTR

general
1

When will the editorial for binstr from november challenge be uploaded? there is an editorial for all other questions except this one

2

Hello

At this moment itself, I am writing the editorial for BINSTR, hoping to complete it by tonight.

Meanwhile, The brief idea is to create another array B which contains indices of strings in sorted order of string values and using persistent segment tree to check, if a range [l,r] in the original array contains any value in range [ll,rr] in B array. Two cases, when range [l,r] contains any string greater in length than query string and otherwise are to be handled separately. This can be referred at Invitation to CodeChef November Long Challenge 2018 sponsored by ShareChat! - #5 by taran_1407 - general - CodeChef Discuss.

1 Like
3

thanx alot taran

4

unfulfilled commitments :slight_smile:

1 Like
5

Had got the editorials done and forwarded to admin days ago. Seems like they havent made editorials public yet. Pinged them

2 Likes
6

Thanks a lot