Skip to content

problem1.md

Latest commit

 

History

History
21 lines (16 loc) · 658 Bytes

problem1.md

File metadata and controls

21 lines (16 loc) · 658 Bytes

Problem 1: Sum Pair Discovery

Problem Statement

Given an array of integers nums and an integer target, return the 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.

Input Format

  • An array of integers nums.
  • An integer target.

Output Format

  • A list of two integers representing the indices.

Constraints

  • 2 <= nums.length <= 10^4
  • -10^9 <= nums[i] <= 10^9
  • -10^9 <= target <= 10^9

Example

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