git-osp-for-beginners icon indicating copy to clipboard operation
git-osp-for-beginners copied to clipboard

Published 20 hours ago • verified publisher icon aditya109

Two Sum [Java-Solution required]

Open aditya109 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.

aditya109 avatar Oct 03 '21 13:10 aditya109

may I please work on this?

mhechavarria avatar Oct 03 '21 13:10 mhechavarria

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

NidhiNivedita6 avatar Oct 03 '21 13:10 NidhiNivedita6

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

hrittik2002 avatar Oct 03 '21 14:10 hrittik2002

#489 Added Two Sum JAVA.

vansh-kapila avatar Oct 05 '21 15:10 vansh-kapila

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 !

aditya109 avatar Oct 05 '21 17:10 aditya109

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

aditya109 avatar Oct 05 '21 17:10 aditya109

Reopening this issue for other contributors !

aditya109 avatar Oct 05 '21 17:10 aditya109

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

SaloniK17 avatar Oct 07 '21 08:10 SaloniK17

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 !

aditya109 avatar Oct 10 '21 05:10 aditya109

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

harshitcodes1 avatar Oct 13 '21 02:10 harshitcodes1

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

Hi @harshitcodes1 ! Please read my comments on your PR. https://github.com/aditya109/git-osp-for-beginners/pull/543#pullrequestreview-778050206

aditya109 avatar Oct 13 '21 03:10 aditya109

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

auchitya avatar Oct 13 '21 21:10 auchitya

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

aditya109 avatar Oct 14 '21 04:10 aditya109