Tap here to switch tabs
Problem
Ask
Submissions

Problem: Two Sum

easy
15 min
Understand how to identify two indices in an array whose values sum to a given target. This lesson helps you implement an optimal O(n) time solution, enhancing your problem-solving skills for coding interviews.

Statement

For the given array of integers arr and a target t, you have to identify the two indices that add up to generate the target t. Moreover, you can’t use the same index twice, and there will be only one solution.

Note: We will assume that the array is zero-indexed and the output order doesn’t matter.

Constraints:

  • 22 \leq arr.length 103\leq 10^3
  • 109-10^9 \leq arr[i] 109\leq 10^9
  • 109-10^9 \leq t 109\leq 10^9
  • Only one valid answer exists.
Tap here to switch tabs
Problem
Ask
Submissions

Problem: Two Sum

easy
15 min
Understand how to identify two indices in an array whose values sum to a given target. This lesson helps you implement an optimal O(n) time solution, enhancing your problem-solving skills for coding interviews.

Statement

For the given array of integers arr and a target t, you have to identify the two indices that add up to generate the target t. Moreover, you can’t use the same index twice, and there will be only one solution.

Note: We will assume that the array is zero-indexed and the output order doesn’t matter.

Constraints:

  • 22 \leq arr.length 103\leq 10^3
  • 109-10^9 \leq arr[i] 109\leq 10^9
  • 109-10^9 \leq t 109\leq 10^9
  • Only one valid answer exists.