aditya109 / git-osp-for-beginners

A GitHub Repository to encourage and involve beginners in Open Source Contributions
GNU General Public License v3.0
106 stars 250 forks source link

Two Sum [Java-Solution required] #463

Open aditya109 opened 3 years ago

aditya109 commented 3 years ago

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:

mhechavarria commented 3 years ago

may I please work on this?

NidhiNivedita6 commented 3 years ago

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

hrittik2002 commented 3 years ago

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

vansh-kapila commented 3 years ago

489 Added Two Sum JAVA.

aditya109 commented 3 years ago

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 commented 3 years ago

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 commented 3 years ago

Reopening this issue for other contributors !

SaloniK17 commented 3 years ago

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

aditya109 commented 3 years ago

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 commented 3 years ago

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

aditya109 commented 3 years ago

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

auchitya commented 3 years ago

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

aditya109 commented 3 years ago

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