You'll learn the two-pointer technique on sorted arrays. Without this foundation, you won't solve Sum, Sum, or Container With Most Water. Here's the pattern: when you need pairs from a sorted array, use two pointers converging from ends. Move based on whether the current result is too small or too large. Amazon, Google, and Microsoft ask this as a warm-up before harder two-pointer problems.
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
$ curl repovive.com/roadmaps/maang-interview-prep/two-pointers-sliding-window/two-sum-ii-why-this-problem
░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░█████████████████████████████████████████████████████████████████████████████████████████████████████████