Find two numbers summing to target
Quick Overview
This Coding & Algorithms interview question for Data Scientist roles evaluates proficiency in array manipulation, lookup data structures (e.g., hash-based approaches) and time–space complexity trade-offs at an intermediate algorithmic level.
Other
Sep 10, 2025, 12:00 AM
Data Scientist
Technical Screen
Coding & Algorithms
0
0
Given an array of integers nums (length n) and an integer target, return the indices (i, j) such that nums[i] + nums[j] == target.
Constraints/assumptions:
- Exactly one valid pair exists.
- You may not use the same element twice.
- Return indices in any order.
- Aim for better than O(n^2) time.
Example:
-
nums = [2, 7, 11, 15],target = 9→ return(0, 1).