Latest Google Aptitude Question SOLUTION: If there is a N sorted array then what is time complexity of finding 2 numbers with sum less than 1000. A) O(1) B) O(n^2) C) O(n) D) O(logn)

• Placement Papers
• /
• Google
• /
• Programming

Google Question Papers: GOOGLE Company Profile

(#M40166794) GOOGLE Programming question Keep an EYE

If there is a N sorted array then what is time complexity of finding 2 numbers with sum less than 1000.
A) O(1) B) O(n^2) C) O(n) D) O(logn)

Asked In Google Devendra Marghade (4 years ago)

Unsolved Read Solution (3)

Is this Puzzle helpful?   (0)   (1) Submit Your Solution