Medium-Easy Understand Arrays & Strings Multiple Choice

After fixing nums[i] in 3Sum, what is the two-pointer time complexity for finding all pairs?

Understand — Tests comprehension and ability to explain concepts.

Answer Options

A O(n) for each fixed i

B O(n log n)

C O(n²)

D O(1)

Get the answer with a detailed explanation, plus practice 34+ more Arrays & Strings questions with adaptive quizzes and timed interviews.

This question is from the Arrays & Strings topic (Data Structures).

What is the time complexity of accessing an element by index in an array?

Which operation has O(n) worst-case time when performed at the beginning of an array?

What is the space complexity of a prefix sum array for n elements?

What does nums.slice(1,3) return for nums = [10,20,30,40,50]?

Output of [1,2,3].map(x=>x*2).filter(x=>x>2) in JavaScript?