- Courses
- Tutorials
- Practice
- Contests
Data Structure
Java
Python
HTML
Interview Preparation
DSA Tutorial - Two Pointer Technique: Question 10
Last Updated :
Discuss
Comments
What will be the time complexity of the algorithm using two pointers to find the triplet with sum equal to zero.
Example : arr = { 1, 3, -5, 7, 3 , -2}
Triplet : {-5 , 7, -2} = 0
O(n)
O(n Log n)
O(n^3)
O(n^2)
This question is part of this quiz :
Quiz on Two Pointer Technique for DSATags:
Share your thoughts in the comments
GeeksforGeeks