please help me as i am not able to figure out how to solve this problem . i want logic only
Chewbaсca and Number
@Shubham_helloworld here is logic: To destroy all the droids on a segment of l to r, we need to make shots, where cnt[i][j] — number of j-type details in i-th droid. Let’s support two pointers — on the beginning and on the end of the segment, which we want to destroy all the droids on. If we can destroy droids on current segment, let’s increase right border of the segment, otherwise increase left border, updating the answer after every segment change. Let’s use a queue in order to find the segment maximum effectively.
I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.
On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.