Step into the Arena
Let Your Code Speak!
The ultimate 1v1 coding battleground. Challenge developers worldwide, climb the ELO leaderboard, and prove your algorithmic mastery.
ConnectedPing: 24ms
RANKED • 10 MIN
1. Two SumEasy
Given an array of integers nums and an integer target, return indices of the two numbers...
Example 1:
Input: nums = [2,7,11,15], target = 9
Output: [0,1]
Natali Craig
Thinking...
09:12
1
2
3
4
5
2
3
4
5
class Solution {
public int[] twoSum(int[] nums, int target) {
// Your code here...
int complement = target - nums[i];
}
}
Orlando Diggs
Writing code
09:45
⚔️
Battle Started
Win by passing all test cases first.