LeetTrainer is the new way
to master LeetCode.
Get personalized AI feedback to ace LeetCode and nail your interviews.
Problem
Solution
Submissions
AI Assistant
Two Sum
EasyGiven an array of integers nums and an integer target, return indices of the two numbers such that they add up to target.
Example:
Input: nums = [2,7,11,15], target = 9
Output: [0,1]
λ
Your Solution
def two_sum(nums, target):
hash_map =
for i, num in enumerate(nums):
complement = target - num
if complement in hash_map:
return [hash_map[complement], i]
hash_map[num] = i
LeetTrainer AI
Your personal coding assistant
Your solution is correct and optimal!
You're using a hash map to track seen values, which gives you O(n) time complexity.
Time & Space Analysis:
- Time Complexity: O(n) - single pass through array
- Space Complexity: O(n) - hash map storage
Similar Problems to Try:
Three SumFour SumTwo Sum II