Consider a sorted array of n numbers and a number x. What would be the time complexity of the best known algorithm to find a triplet with sum equal to x. For example arr[] = 1 5 10 15 20 30 x = 40. Then there is a triplet 5 15 20 with sum 40.(A) O(n)(B) O(n^2)(C) O(n Log n)(D) O(n^3)

Explore topic-wise InterviewSolutions in .

This section includes InterviewSolutions, each offering curated multiple-choice questions to sharpen your knowledge and support exam preparation. Choose a topic below to get started.

1.	Consider a sorted array of n numbers and a number x. What would be the time complexity of the best known algorithm to find a triplet with sum equal to x. For example, arr[] = {1, 5, 10, 15, 20, 30}, x = 40. Then there is a triplet {5, 15, 20} with sum 40.(A) O(n)(B) O(n^2)(C) O(n Log n)(D) O(n^3)
Answer»

Discussion

Explore topic-wise InterviewSolutions in .

Consider a sorted array of n numbers and a number x. What would be the time complexity of the best known algorithm to find a triplet with sum equal to x. For example, arr[] = {1, 5, 10, 15, 20, 30}, x = 40. Then there is a triplet {5, 15, 20} with sum 40.(A) O(n)(B) O(n^2)(C) O(n Log n)(D) O(n^3)