/**
 * This function takes two dictionaries as inputs and returns a new dictionary containing the intersection
 * of the keys from both dictionaries, excluding the keys present in the first dictionary but not in the second.
 */
fun intersectionDictNotOperator(dictionary1: Map<String, Int>, dictionary2: Map<String, Int>): Map<String, Int> {

    val intersection = mutableMapOf<String, Int>()

    // Check if dictionaries are empty
    if (dictionary1.isEmpty() || dictionary2.isEmpty()) {
        return intersection
    }

    // Loop through the keys in dictionary1
    for ((key, value) in dictionary1) {
        // Check if key is not found in dictionary2
        if (!dictionary2.containsKey(key)) {
            continue
        }
        // Check if the values of the corresponding keys in both dictionaries are not equal
        if (value != dictionary2[key]) {
            // Check if the key is not already present in the intersection dictionary
            if (!intersection.containsKey(key)) {
                // Add the key-value pair to the intersection dictionary
                intersection[key] = value
            }
        }
    }

    return intersection
}
/**
 * This function takes two dictionaries as inputs and returns a new dictionary containing the intersection
 * of the keys from both dictionaries, excluding the keys present in the first dictionary but not in the second.
 */
fun intersectionDictNotOperator(dictionary1: Map<String, Int>, dictionary2: Map<String, Int>): Map<String, Int> {
/**
 * This function takes two dictionaries as inputs and returns a new dictionary containing the intersection
 * of the keys from both dictionaries, excluding the keys present in the first dictionary but not in the second.
 */
fun intersectionDictNotOperator(dictionary1: Map<String, Int>, dictionary2: Map<String, Int>): Map<String, Int> {

    val intersection = mutableMapOf<String, Int>()

    // Check if dictionaries are empty
    if (dictionary1.isEmpty() || dictionary2.isEmpty()) {
        return intersection
    }

    // Loop through the keys in dictionary1
    for ((key, value) in dictionary1) {
        // Check if key is not found in dictionary2
        if (!dictionary2.containsKey(key)) {
            continue
        }
        // Check if the values of the corresponding keys in both dictionaries are not equal
        if (value != dictionary2[key]) {
            // Check if the key is not already present in the intersection dictionary
            if (!intersection.containsKey(key)) {
                // Add the key-value pair to the intersection dictionary
                intersection[key] = value
            }
        }
    }

    return intersection
}