Two Sum
Try to solve the Two Sum problem.
We'll cover the following
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:
-
arr.length
-
arr[i]
-
t
- Only one valid answer exists.
Examples
Level up your interview prep. Join Educative to access 80+ hands-on prep courses.