Your question is Complexity of Hash Map Search. Take a moment with it on the right.
Talk me through your thinking if you like. When you're confident, submit your answer and I'll grade it like a real screen (7/10 or better passes).
Given an implementation that scans an array once while storing seen values in a hash map to find a matching target condition, what is its time and space complexity, and why?