Created
February 13, 2024 00:10
-
-
Save gowthamkaruturi/3042f887b874f16dd471139c16ff2c01 to your computer and use it in GitHub Desktop.
two sum problem
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
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] | |
Example 3: | |
Input: nums = [3,3], target = 6 | |
Output: [0,1] |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment