DSA

got this opportunity from google big code
google is BS paglu (for sde intern)

round 1 (online interview) given : array to find : find kth subaary sum explanation : you have given an array now generate n2 subarrays then calculate the each subarray sum and then array that in sorted order(including duplicate sum) then find the kth sum

topics : Binary search , two pointer , sliding window, prefix sum

got rejected in round one as i was able to think of only heap and prefix sum appraoch :

DSA