Two pointer approach pair sum

#1

lets suppose my array is 1 , 3 , 3 , 7 ,10, 11, 12 , 13 and question is find out the no . of pair having sum 16 so aacording to the video lecture we will only get 1 pair but answer will be 2 pairs

#2

@vivekthakur8102000
yeah actually you have to do this using map.
2 pointer works when you have to check whether a pair which have sum equal to target exists or not.