Roadmap DSA Tracker Code Editor Tech Blogs

Loading question...

The ultimate platform to master JavaScript interviews. Comprehensive questions, interactive practice, and detailed explanations.

Explore

Home
Practice Arena
Browse Topics
All Questions

Resources

Learning Roadmap
Cheatsheets
Tech Blog
Community

Stay Updated

Get the latest interview questions and tips delivered to your inbox.

Join 5,000+ developers

© 2026 JS Interview Prep. Made withby developers.

Privacy Terms Cookies

Buy Me A Coffee

Two Sum

Medium

00:00

0 users online

Given an array of integers and a target sum, return indices of the two numbers that add up to the target.

Sample Input:

[2, 7, 11, 15], 9

Sample Output:

[0, 1]

Hints

Hint 1

Use a hash map to store previously seen numbers and their indices

Hint 2

For each number, check if (target - current number) exists in the map

Hint 3

This approach gives O(n) time complexity

Code Editor

Loading...