#12. Java Program To Find All Pairs From Integer Array Whose Sum Equal To A Number | Using HashSet| 

couple of queries: 1) In This logic time complexity is good but space complexity is again problem, because if array has 1 lac elements container will have to store so many elements thats would be a memory issue 2) What if array contains 20 ? and target is also 20 ? what does it print ?

Pls share the program to print all possible sub arrays that form given sum

Audio quality is really worse