Two Sum [Java-Solution required]

Question

Two Sum [Java-Solution required]

Opened this issue 3 years ago · 13 comments

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 specific target number. Let these two numbers be numbers[index1] and numbers[index2] where 1 <= first < second <= numbers.length.

Return the indices of the two numbers, index1 and index2, 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:

Input: numbers = [2,7,11,15], target = 9
Output: [1,2]
Explanation: The sum of 2 and 7 is 9. Therefore index1 = 1, index2 = 2.

Example 2:

Input: numbers = [2,3,4], target = 6
Output: [1,3]
Explanation: The sum of 2 and 4 is 6. Therefore index1 = 1, index2 = 3.

Example 3:

Input: numbers = [-1,0], target = -1
Output: [1,2]
Explanation: The sum of -1 and 0 is -1. Therefore index1 = 1, index2 = 2.

Constraints:

2 <= numbers.length <= 3 * 104
-1000 <= numbers[i] <= 1000
numbers is sorted in non-decreasing order.
-1000 <= target <= 1000
The tests are generated such that there is exactly one solution.

Answer 1 · 2021-10-03T13:20:48.000Z

may I please work on this?

Answer 2 · 2021-10-03T13:55:05.000Z

Hello @aditya109,
Could you please assign this issue to me? I would like to work on it.

Answer 3 · 2021-10-03T14:06:29.000Z

Hello, I would like to solve this problem. Could you please assign this to me?

Answer 4 · 2021-10-05T15:40:56.000Z

#489 Added Two Sum JAVA.

Answer 5 · 2021-10-05T17:23:38.000Z

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 !

Answer 6 · 2021-10-05T17:24:52.000Z

Hi guys ! Love to see such enthusiasm ! You can all raise PR for this issue. Just adhere according to CONTRIBUTING.md. Happy Hacking guys !

Answer 7 · 2021-10-05T17:26:10.000Z

Reopening this issue for other contributors !

Answer 8 · 2021-10-07T08:46:20.000Z

Hello,, I would like to solve this problem. Could you please assign this to me?
Thank You.

Answer 9 · 2021-10-10T05:48:05.000Z

Hi @SaloniK17 ! Sure thing. 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 !

Answer 10 · 2021-10-13T02:33:24.000Z

Please Check I have made a Pull Request #543. Thank You.

Answer 11 · 2021-10-13T03:17:19.000Z

Please Check I have made a Pull Request #543. Thank You.

Hi @harshitcodes1 ! Please read my comments on your PR.
#543 (review)

Answer 12 · 2021-10-13T21:17:59.000Z

@aditya109 could you please assign this to me? I would love to solve it.

Answer 13 · 2021-10-14T04:13:39.000Z

@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 !