Solution for this problem
hello @sraj39273
have u solved array target pair sum problem?
this is small variation of that problem.
a) first sort the array.
b) then iterate from i=0 and n-1 and fix this as one of the required integer
c) now to find remaing two in range [i+1…n-1] use two pointer approach
refer this code for clarity->
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.