map<int, int> mp;
mp[1] = 10;
if (mp[2] > 0) { // This will insert the key '2' with a default value of 0
    // Do something
}
cout << mp.size(); // Output will be 2, not 1

// Using mp.find(x) != mp.end()
// The find() method returns an iterator to the element if it exists, or mp.end() if it doesn’t.

if (mp.find(x) != mp.end()) {
    // Key 'x' exists in the map
} else {
    // Key 'x' does not exist
}

// This method doesn’t modify the map, so the size remains unchanged.
// find() gives you access to the value directly if needed.
// Time Complexity same as (mp[x] > 0)

// The count() method returns the number of occurrences of the key x in the map (which is either 0 or 1 in map and unordered_map).

if (mp.count(x) == 1) {
    // Key 'x' exists in the map
} else {
    // Key 'x' does not exist
}

// Like find(), this method checks for the existence of a key without inserting it, thus avoiding unintended side effects.
// count() is more straightforward if you only need to check for existence and don’t need the value.
// Time Complexity same as (mp[x] > 0)

map<int, int> mp;
mp[1] = 10;
cout << "Initial size: " << mp.size(); // Output: 1
if (mp[2] > 0) {
    // This will insert key '2' with value 0
}
cout << "Size after mp[2] > 0: " << mp.size(); // Output: 2

if (mp.find(3) != mp.end()) {
    // This will not insert key '3'
}
cout << "Size after mp.find(3): " << mp.size(); // Output: 2

if (mp.count(4) == 1) {
    // This will not insert key '4'
}
cout << "Size after mp.count(4): " << mp.size(); // Output: 2