Skip to content
This repository has been archived by the owner on Oct 14, 2021. It is now read-only.

Two Sum [Java-Solution required] #463

Open
aditya109 opened this issue Oct 3, 2021 · 13 comments · Fixed by #489
Open

Two Sum [Java-Solution required] #463

aditya109 opened this issue Oct 3, 2021 · 13 comments · Fixed by #489
Assignees

Comments

@aditya109
Copy link
Owner

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.
@mhechavarria
Copy link

mhechavarria commented Oct 3, 2021

may I please work on this?

@NidhiNivedita6
Copy link

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

@hrittik2002
Copy link

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

@vansh-kapila
Copy link
Contributor

#489 Added Two Sum JAVA.

@aditya109
Copy link
Owner Author

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
Copy link
Owner Author

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
Copy link
Owner Author

Reopening this issue for other contributors !

@aditya109 aditya109 reopened this Oct 5, 2021
@SaloniK17
Copy link

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

@aditya109
Copy link
Owner Author

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 !

@harshitcodes1
Copy link
Contributor

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

@aditya109
Copy link
Owner Author

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

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

@auchitya
Copy link

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

@aditya109 aditya109 linked a pull request Oct 14, 2021 that will close this issue
@aditya109 aditya109 assigned auchitya and unassigned SaloniK17 Oct 14, 2021
@aditya109
Copy link
Owner Author

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

Sign up for free to subscribe to this conversation on GitHub. Already have an account? Sign in.
Projects
None yet
8 participants