Coding Interview - Python, Java, Programming, AI Tools & Tech News
May 25, 2025 at 05:33 PM
*Correct Answer: C) Hash Map*
In the Two Sum problem, we check if the complement of the current number exists in a hash map.
This lookup and insertion take O(1) time per element.
Hence, total time complexity becomes O(n) using a Hash Map.
*React with ❤️ if you got it right!*
❤️
❤
👍
🦋
36