Skip to content
6
0
:
0
0

Route Cost Pair

Hard

Hash

In "Route Cost Pair", you are given a list of integer values and a target total. Find the two different positions whose values add up to the target.

Return the two indices in any order. You may assume there is exactly one valid answer.

Example 1

Input:nums = [20,25,31,22,40], target = 42
Output:[0,3]

For input nums = [20,25,31,22,40], target = 42, Indices [0,3] are correct because nums[0] + nums[3] = 20 + 22 = 42. Therefore, return [0,3].

Example 2

Input:nums = [23,40,28,60,29], target = 68
Output:[1,2]

For input nums = [23,40,28,60,29], target = 68, Indices [1,2] are correct because nums[1] + nums[2] = 40 + 28 = 68. Therefore, return [1,2].

Constraints

  • 2 <= nums.length <= 104
  • -109 <= nums[i] <= 109
  • -109 <= target <= 109
  • Exactly one valid pair exists.
solution.js
Loading...

Test Cases (2)

Test Case 1
Input:
[20,25,31,22,40], 42
Expected Output:
[0,3]
Test Case 2
Input:
[23,40,28,60,29], 68
Expected Output:
[1,2]