Available question text
Given an array of integers and a target value, return the indices of two numbers that add up to the target
Related questions
Continue with questions that share topics or the same question type.
- Given a sorted integer array arr, two integers k and x, return the k closest integers to x in the array. The result should also be sorted in ascending order.
Coding
- Given an array nums and a sliding window of size k moving from the very left to the very right, return the maximum value in the window for each position. Solve in O(n) time using a deque.
Coding
- Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand (e.g., [4,5,6,7,0,1,2]). Search for a target value and return its index, or -1 if not found. Required time complexity: O(log n).
Coding
- The first was leetcode Set Matrix Zeroes.
The LeetCode problem Set Matrix Zeroes is a classic 2D array manipulation problem. The description is as follows:
You are given an
𝑚
×
𝑛
m×n matrix of integers. If any element is 0, you must set its entire row and column to 0. In other words, for each cell that contains 0, all cells in the same row and column should be changed to 0.
Coding
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Glassdoor · 1 record
Meta
Given an array of integers and a target value, return the indices of two numbers that add up to the target
Reported date not specified · 1 source report
Software Engineer
Source snapshot: Nov 12, 2026
View source