ProblemNest
Sign In
You are coding as a Guest. Sign in with your RoleNest account to permanently track your streak, earn XP, and climb the Campus Leaderboard!
Sign In with RoleNest
🔥Two Sum: Target Pair IndexerEasy
EasyArrays & Hashing•Acceptance: 53.2%

Two Sum: Target Pair Indexer

Real-World Engineering Context
Used in financial order book matching at Zerodha and Razorpay to instantaneously pair matching buy and sell prices with O(n) hash map lookups.
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. Return the answer in any order.

Sample Test Cases

Input: [[2,7,11,15],9]
Expected: [0,1]
Input: [[3,2,4],6]
Expected: [1,2]
Input: [[3,3],6]
Expected: [0,1]

Constraints

  • 2 <= nums.length <= 10^4
  • -10^9 <= nums[i] <= 10^9
  • -10^9 <= target <= 10^9
  • Only one valid answer exists.