Target sum triplet

#1

how is it O(N^2) in the video explanation of Target sum triplet

#2

hello @s.kumar

we are using a loop to fix one integer and then for each fixed integer to find remaining two we are using two pointers approach O(N).
so O(FIXING ONE INTEGER * TIME IN TWO POINTERS)=>
o(n * n)