Hello, I just came to this problem statement and seems interesting as well as hard. anyone can give any ideas about how to solve it..? there was no constraints. what is min TC we can achieve ?

Given an array A.

You may repeatedly choose any subarray whose sum is exactly K and delete it.

The remaining parts join together.

Find the maximum number of deletions possible.