find all the sets of 4 no.s from given vector such that their sum is equal to target and there should not be any duplicate sets.(leetcode)(O(n^3))

Question

i am using this two pointers approach but it is not passing all the test cases. It is not able to find all such sets, i just want to know that why it is not finding all the set