How CodeQuest Works
Join thousands of students improving their coding skills with daily challenges
Daily Challenges
New coding problems every day across different difficulty levels and programming concepts
Community Learning
Share solutions, discuss approaches, and learn from peers in a collaborative environment
Track Progress
Earn points, unlock achievements, and climb the leaderboard as you solve more challenges
Today's Challenge
Solve today's problem and start your coding streak
Given an array of integers nums
and an integer target
, return the 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]
Solve this challenge to earn 50 points
Join Our Community
Connect with other coders, share your solutions, and learn together
Join a thriving community of coders from around the world.
Access our growing library of coding challenges across all difficulty levels.
Get help from our community and mentors whenever you need it.