-
Notifications
You must be signed in to change notification settings - Fork 249
Two Sum [Java-Solution required] #463
Comments
may I please work on this? |
Hello @aditya109, |
Hello, I would like to solve this problem. Could you please assign this to me? |
#489 Added Two Sum JAVA. |
Hi @mhechavarria ! I have assigned this issue to 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 ! |
Hi guys ! Love to see such enthusiasm ! You can all raise PR for this issue. Just adhere according to CONTRIBUTING.md. Happy Hacking guys ! |
Reopening this issue for other contributors ! |
Hello,, I would like to solve this problem. Could you please assign this to me? |
Hi @SaloniK17 ! Sure thing. I have assigned this issue to you. |
Please Check I have made a Pull Request #543. Thank You. |
Hi @harshitcodes1 ! Please read my comments on your PR. |
@aditya109 could you please assign this to me? I would love to solve it. |
Hi @auchitya ! I have assigned this issue to 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: