ApexCode
ProblemsContestsCategoriesLeaderboardCommunity
Log InSign Up
ApexCode

Next-generation competitive programming platform empowering developers to learn, compete, and excel.

Platform

  • Problems
  • Contests
  • Categories
  • Leaderboard

Community

  • Discussion Board
  • Share Post
  • Discord Server

Backend Architecture

Frontend powered by Next.js App Router on Vercel. Code execution handled independently via Spring Boot & Isolated Docker containers.

© 2026 ApexCode. All rights reserved.Built with Next.js & Supabase
EasyDSA

Two Sum

ArrayHash Table

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 has exactly one solution, and you may not use the same element twice.

Return the indices in any order.

Example 1:
Input: nums = [2,7,11,15], target = 9
Output: [0,1]
Explanation: nums[0] + nums[1] = 9.

Example 2:
Input: nums = [3,2,4], target = 6
Output: [1,2]

Example 3:
Input: nums = [3,3], target = 6
Output: [0,1]

Constraints:
- 2 <= nums.length <= 10000
- -1000000000 <= nums[i] <= 1000000000
- -2000000000 <= target <= 2000000000
- Exactly one valid answer exists.
Language:
Loading...
Test Cases3
Input:
{"nums":[3,3],"target":6}
Expected Output:
[0,1]