0001. Two Sum
Easy — Array, Hash Table
0002. Add Two Numbers →
Brute Force
Hash Map (Optimal)
Two Pointers
Compare All
Apply
🎲 Generate
Size:
4
6
8
10
15
20
Range:
-20..20
-50..50
-100..100
-500..500
▶ Play
▮▮ Pause
⏭ Step
↺ Reset
Speed:
Slow
Normal
Fast
Very Fast
▶ Press "Play" or use "Step" to walk through step by step.
Qadam
0 / 0
Operations
0
Time
—
Space
—
Default
Active
Comparing
Found
Visited
Algorithm Complexity
Brute Force
O(n²)
O(n²) / O(1)
Two-pass HashMap
O(n)
O(n) / O(n)
Two Pointers
O(n log n)
O(n log n) / O(1)
One-pass HashMap
O(n)
O(n) / O(n)