| CARVIEW |
Select Language
HTTP/2 200
content-type: text/html; charset=utf-8
date: Thu, 28 Aug 2025 05:41:37 GMT
permissions-policy: interest-cohort=()
strict-transport-security: max-age=31536000; includeSubDomains
server: nginx
cache-control: s-maxage=60389, max-age=0
x-powered-by: Next.js
etag: "13ti6wje6w07xgo"
content-encoding: gzip
x-xss-protection: 1; mode=block
x-content-type-options: nosniff
referrer-policy: no-referrer-when-downgrade
content-security-policy: default-src 'self' http: https: ws: wss: data: blob: 'unsafe-eval' 'unsafe-inline'; frame-ancestors 'self';
vary: Accept-Encoding
x-cache: Miss from cloudfront
via: 1.1 d43494f195e4e3dd7202dfa9e17d6efe.cloudfront.net (CloudFront)
x-amz-cf-pop: BOM78-P9
x-amz-cf-id: jHTtoqtKPPxzE9KSjIr-5O0LdwMRCpdB6ZJhmWBzwfysNdoK_w6mtA==
DSA Tutorial - Two Pointer Technique: Question 8 
- Courses
- Tutorials
- Practice
- Jobs
Data Structure
Java
Python
HTML
Interview Preparation
Interview Preparation
- Interview Preparation For Software Developers
- Must Coding Questions - Company-wise
- Must Do Coding Questions - Topic-wise
- Company-wise Practice Problems
- Company Preparation
- Competitive Programming
- Software Design-Patterns
- Company-wise Interview Experience
- Experienced - Interview Experiences
- Internship - Interview Experiences
DSA Tutorial - Two Pointer Technique: Question 8
Last Updated :
Discuss
Comments
Consider an array consisting of –ve and +ve numbers. What would be the worst case time complexity to segregate the numbers having same sign altogether i.e all +ve on one side and then all -ve on the other using two pointer technique?
O(N log N)
O(N)
O(N * N)
O(log N)
This question is part of this quiz :
Quiz on Two Pointer Technique for DSATags:
Share your thoughts in the comments
GeeksforGeeks
We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and understood our Cookie Policy & Privacy Policy