Shouldn’t we get TLE if we solve this in O(n^2) ?
Target Sum Pair, Brute force solution Accepted
@tasfikrahman007 hey yes normally it should give but that question may be of brute force and have test cases according to it but you should also try efficient approach better than n2.