Skip to content

problem1.md

Latest commit

 

History

History
14 lines (11 loc) · 499 Bytes

problem1.md

File metadata and controls

14 lines (11 loc) · 499 Bytes

Problem 1: Constant-Time Identification (Two Sum)

Problem Statement

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.

Input Format

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

Example

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