Skip to content

Instantly share code, notes, and snippets.

@iamgoangle

iamgoangle/2sum.txt

Created August 10, 2022 06:00
Show Gist options

  • Select an option

    Learn more about clone URLs
  • Save iamgoangle/82e893371fea869412587d2f5efb5f89 to your computer and use it in GitHub Desktop.

Select an option

Learn more about clone URLs
Save iamgoangle/82e893371fea869412587d2f5efb5f89 to your computer and use it in GitHub Desktop.
Download ZIP
2-sum-challenges
Raw
2sum.txt
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]
Explanation: Because nums[0] + nums[1] == 9, we return [0, 1].
Example 2:
Input: nums = [3,2,4], target = 6
Output: [1,2]
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment