Find two numbers that sum to target
Overview
This question evaluates a candidate's competency in array manipulation, index reasoning, and efficient algorithmic techniques for pair-sum problems. It is commonly asked in technical interviews to measure problem-solving ability, understanding of algorithmic complexity, and practical implementation skills within the Coding & Algorithms domain, focusing on practical application rather than purely conceptual theory.
Other
Sep 28, 2025, 12:00 AM
Data Scientist
Technical Screen
Coding & Algorithms
0
0
Problem
You are given an integer array nums (length n) and an integer target.
Return the indices (i, j) such that:
-
i != j -
nums[i] + nums[j] == target
Assume:
- Exactly one valid pair exists.
- You may return the indices in any order.
Example
-
Input:
nums = [2, 7, 11, 15],target = 9 -
Output:
(0, 1)