.png)
2 days ago
2
This looks like a variation of the Two Sum problem. You can solve it in O(n) time using a hash map. Let me show you the Python code:
def two_sum(nums, target): seen = {} for i, num in enumerate(nums): if target - num in seen: return [seen[target - num], i] seen[num] = i⚡
Explanation:
This function solves the Two Sum problem in linear time O(n) using a dictionary:
- seen is a dictionary that keeps track of numbers we've already encountered and their indices.
- For each number in the list, we compute the difference between the target and the current number.
- If that difference is already in seen, we found the pair — return both indices.
- Otherwise, store the current number and its index in the dictionary for future lookups.
- This avoids using nested loops and ensures the algorithm runs efficiently, even on large lists.
