Find the two indices in a sorted array summing to 10 and join them.
Acceptance criteria
- 1.#out should show 2-3.
DSA Tutorial · Two Pointers and Sliding Window
Practice: The Two Pointer Technique
These 10 tasks go with The Two Pointer Technique chapter. 5 of them ask you to build something small from scratch; 5 give you code that is already broken and ask you to work out why. Set aside about 90 minutes for the whole set, though you can do them in any order.
Nothing here is marked by a person. When you press Submit, the editor checks your code against the points listed under each task and tells you straight away what passed and what didn't (you need a free account to submit). If you get stuck, there are hints, and a worked solution once you've had a go. The first 2 tasks are free; the rest are part of the practice plan.
If it's been a while since you read the chapter, here is how it starts: “Two pointers is how you get hash-map speed without hash-map memory. It only works when the input has an order you can exploit — which is why the first move is so often to sort.” .