/**
 * This function takes in two lists and finds the intersection of the two lists
 * excluding the elements that are equal and not equal using the 'is not' operator.
 *
 * @param lst1 The first list.
 * @param lst2 The second list.
 * @return The intersection of the two lists excluding the elements that are equal and not equal.
 */
fun intersectionNotEqualIsNotOperator(lst1: List<Any>, lst2: List<Any>): List<Any> {

    // Initialize an empty list to store the intersection
    val intersection = mutableListOf<Any>()

    // Iterate over each element in lst1
    for (item1 in lst1) {
        // Iterate over each element in lst2
        for (item2 in lst2) {
            // Check if item1 is not equal to item2 using 'is not' operator
            if (item1 !== item2) {
                // Append the element to the intersection list
                intersection.add(item1)
            }
        }
    }

    return intersection
}
/**
 * This function takes in two lists and finds the intersection of the two lists
 * excluding the elements that are equal and not equal using the 'is not' operator.
 *
 * @param lst1 The first list.
 * @param lst2 The second list.
 * @return The intersection of the two lists excluding the elements that are equal and not equal.
 */
fun intersectionNotEqualIsNotOperator(lst1: List<Any>, lst2: List<Any>): List<Any> {
/**
 * This function takes in two lists and finds the intersection of the two lists
 * excluding the elements that are equal and not equal using the 'is not' operator.
 *
 * @param lst1 The first list.
 * @param lst2 The second list.
 * @return The intersection of the two lists excluding the elements that are equal and not equal.
 */
fun intersectionNotEqualIsNotOperator(lst1: List<Any>, lst2: List<Any>): List<Any> {

    // Initialize an empty list to store the intersection
    val intersection = mutableListOf<Any>()

    // Iterate over each element in lst1
    for (item1 in lst1) {
        // Iterate over each element in lst2
        for (item2 in lst2) {
            // Check if item1 is not equal to item2 using 'is not' operator
            if (item1 !== item2) {
                // Append the element to the intersection list
                intersection.add(item1)
            }
        }
    }

    return intersection
}