217. Contains Duplicates

📝 Problem Details

• Title: 217. Contains Duplicates
• Link: https://leetcode.com/problems/contains-duplicate/
• Difficulty: Easy
• Tags/Categories: Hashmap Arrays

💭What Were My Initial Thoughts?

- insert each element into a hashset
- if the character already exists in the hashset prior to insertion, return true

💡 Explanation of Solution

same as intuition

⌛ Complexity Analysis

Time Complexity: O(n)
Space Complexity: O(n)

💻 Implementation of Solution

class Solution {
public:
    bool containsDuplicate(vector<int>& nums) {
        unordered_set<int> set;
 
        for(int i=0; i<nums.size(); i++) {
            if(set.find(nums[i]) != set.end()) {
                return true;
            }
            set.insert(nums[i]);
        }
        return false;
    }
};