Array: [1,2,3,4,5,6,7,8]. Find the pair that sums to 9 using two pointers. How many moves are needed?

Question

Accepted Answer

(C) 4. Explanation: L=0(1),R=7(8): 9=9✓ done in 1 check. But 'how many moves' means pointer movements: L starts at 0, R at 7. 1+8=9 ✓ in 1 comparison. If question means total unique pairs: (1,8),(2,7),(3,6),(4,5) = 4 pairs.