Check Subarray with Sum

#1

in bruteforce approach i think time complexcity will be O(n^3) but sir have said that it will have O(n^2)???

#2

Yes the brute force approach will have a time complexity of O(n^2). This is because we will have two loops -
one for the current element and other for all the subarrays starting from that element.

#3

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.