Skip to content

Created Two Sum in java - #353

Open
Divya333 wants to merge 1 commit into
kanak22:mainfrom
Divya333:patch-1
Open

Created Two Sum in java#353
Divya333 wants to merge 1 commit into
kanak22:mainfrom
Divya333:patch-1

Conversation

@Divya333

@Divya333 Divya333 commented Oct 5, 2021

Copy link
Copy Markdown

Related Issue

  • Info about the related issue

Closes: #[issue number that will be closed through this PR]

Describe the changes you've made

Give a clear description what modifications you have made

Mention any unusual behaviour of your code (Write NA if not)

Any unusual behaviour of your code

Checklist:

(To mark, write x inside the square brackets like this: [x])

  • My code follows the guidelines of this project.
  • I have performed a self-review of my own code.
  • I have commented my code, particularly whereever it was hard to understand.
  • My changes generate no new warnings.

Additional Info (optional)

Any additional information you want to give

@kanak22

kanak22 commented Oct 7, 2021

Copy link
Copy Markdown
Owner

Link issue in the description of this PR

@Divya333

Divya333 commented Oct 8, 2021

Copy link
Copy Markdown
Author

Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to target.

You may assume that each input would have exactly one solution, and you may not use the same element twice.

You can return the answer in any order.

Example 1:

Input: nums = [2,7,11,15], target = 9
Output: [0,1]
Output: Because nums[0] + nums[1] == 9, we return [0, 1].

@kanak22

kanak22 commented Oct 9, 2021

Copy link
Copy Markdown
Owner

link the issue with the issue number, every issue have a issue number

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

2 participants