@shilpu and @malinovsky239 … please tell the bug in this code… i still can not figure out the bug … kindly respond quick … it is troubling me a lot …
here is basic idea to the code i wrote
.make boundaries for child’s division (a,b) — i write it as a-0.2 and b+0.2
.query chefs interval as it is.
. count how many intervals in between l and r via binary search if 0 then fine else “No”.
. some modifications for l>r cases (cyclicity) …clear in code.
please respond with test cases … if u cant figure out any then also respond …
here is the link