Approach 1: Hash Table
- Time:O(m + n)
- Space:O(\min(m, n))
C++ |
---|
|
JAVA |
---|
|
Python |
---|
|
Approach 2: Two Pointers
- Time:O(m\log m + n\log n)
- Space:O(\min(m, n))
C++ |
---|
|
Approach 3: Binary Search
- Time:O(\min(m\log n, n\log m))
- Space:O(\min(m, n))
C++ |
---|
|