LeetCode 1 - Blind 75: Two Sum Solution in Swift

Apologies I did not include the space/time complexity in the complements example. The space and time is:

Time: O(n) because the algorithm is only making 1 pass through the array to find the solution
Space: O(n) due to the additional space of creating a hashmap

Cheers!