-
Notifications
You must be signed in to change notification settings - Fork 250
Two Sum [C#-Solution required] #459
Comments
Hey, I m interested in contributing to this issue. |
I would like to help, can you assign me? |
Hi @rahulbhatt1899 @ameeet ! Sure thing. I have assigned this issue to you guys. |
@aditya109 created pull request |
Hi @ameeet ! I have reviewed your pull request. PTAL at my comment on it and fix them. |
Also, as you seem to be interested in the solving this issue, I am assigning this you. Before raising a PR, please take a look at CONTRIBUTING.md and follow the guidelines. Also, if it is not too much to ask, please consider starring ⭐ the repository. It helps boost the repo popularity and guide more people towards active contribution. That is all. Happy hacking ! |
Given a 1-indexed array of integers
numbers
that is already *sorted in non-decreasing order*, find two numbers such that they add up to a specifictarget
number. Let these two numbers benumbers[index1]
andnumbers[index2]
where1 <= first < second <= numbers.length
.Return the indices of the two numbers,
index1
andindex2
, as an integer array[index1, index2]
of length 2.The tests are generated such that there is exactly one solution. You may not use the same element twice.
Example 1:
Example 2:
Example 3:
Constraints:
2 <= numbers.length <= 3 * 104
-1000 <= numbers[i] <= 1000
numbers
is sorted in non-decreasing order.-1000 <= target <= 1000
The text was updated successfully, but these errors were encountered: