Getting tle in the question
your code time complexity is O(n^2) for each testcase
total comlexity O(n^2*K)
which is very large
try to do it in O(n) using kadan’s algorithm
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.