Two Sum
4 min readMaster the classic Two Sum algorithm: find array indices that sum to target. Learn brute force O(n²) vs HashMap O(n) solutions. Asked by Amazon, Apple, Netflix, Microsoft in coding interviews.
-
Arrays Overview
-
Shifting Algorithms
-
Array Construction
-
Dynamic/Resizable Arrays
-
2D Arrays
-
3D Arrays
-
Array Problems
- Two Sum
- Find Largest Value
- Search an Element (Linear & Binary)
- Monotonic Array
- Find Even Number Of Digits
- Find Duplicate Element
- Find Odd Occurring Element
- Reverse Array: Array In-Place Algorithm
- How to reverse the letters in a string in Java
- Challenge 1: Missing Number
- Solution Review: Missing Number
- Challenge 2: Single Number
- Solution Review: Single Number
- Subsets Or Powerset
Two Sum
Reading Progress