All Problems
Practice previous year questions from all companies and topics.
| Status | Problem Title | Difficulty | Company | Topic | Action |
|---|---|---|---|---|---|
Back to Google Problems
easyArrays
Two Sum
Description
Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to target.
You may assume that each input would have exactly one solution, and you may not use the same element twice.
Example:
Input: nums = [2,7,11,15], target = 9
Output: [0,1]
Explanation: Because nums[0] + nums[1] == 9, we return [0, 1].
Constraints
- 2 <= nums.length <= 10^4
- -10^9 <= nums[i] <= 10^9
- -10^9 <= target <= 10^9
- Only one valid answer exists.
Code Editor Coming Soon!In Progress
We're building something amazing
Multi-language support (C++, Python, Java, JavaScript)
Real-time code execution with test cases
Syntax highlighting & auto-completion
Save your solutions automatically
Compare with optimal solutions
Development Progress65%
⚡ Expected launch: Q1 2026
💡 For now, practice solving on your local IDE and we'll notify you when the editor is ready!
Timer
0:00
Ready to start
Try to solve within 30-45 minutes. Good interview practice!
Problem Stats
Acceptance Rate68.4%
Total Solved1,245
Average Time25 mins
Your StatusNot Attempted