Approach to the problem

i can’t figure out how to approach to this problem.

@tusharbhardwaj127 Use two Pointers for this problem

can you please elaborate?

@tusharbhardwaj127 Increase right of the subarray until the number of changes are k. As soon as you see that no of changes has increases the value of k, start increasing l until the changes are less than or equal to k.