how to do it with dp i was trying it to do it with dp but didnt get??
1 count problem dp
can you share the link of the problem
It’s the same problem. In which I raised doubt… I cannot share pdf because there is no link in it
Is this the problem statement:
Given an array of size n with 0s and 1s , flip at most k 0s to get the longest possible subarray of 1s.
Yesss this is the problem…