# Introduction In this challenge, we aim to solve the Two Sum II problem. We must locate two integers in a sorted array that add up to a particular target number. Our task is to provide an array of indices corresponding to these two numbers, ensuring that the first index is smaller than the second one. We have to solve this using a constant amount of extra space.
Click the virtual machine below to start practicing