how to solve this with dp
1 Count with Dp
the two approaches i can think of solving this question are two pointers(which probably you have used) and binary search techninque. I don’t see how it can be solved using dynamic programming.
But the challenge is under DP
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.