/**
 * This exercise aims to test your understanding of function calls and the 'in' operator.
 * You are required to write a function that takes two lists as arguments and returns a new list
 * containing the intersection of the unique elements from both lists.
 *
 * @param lst1 The first list of elements.
 * @param lst2 The second list of elements.
 * @return A new list that contains the intersection of the unique elements from both input lists.
 */
fun intersectionListFunctionCalls(lst1: List<Any>, lst2: List<Any>): List<Any> {

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

    // Iterate through each element in lst1
    for (element in lst1) {
        // Uniquely check if the element exists in both lst1 and lst2
        if (element in lst2 && element !in intersectionList) {
            intersectionList.add(element)
        }
    }

    // Return the intersection list
    return intersectionList
}
/**
 * This exercise aims to test your understanding of function calls and the 'in' operator.
 * You are required to write a function that takes two lists as arguments and returns a new list
 * containing the intersection of the unique elements from both lists.
 *
 * @param lst1 The first list of elements.
 * @param lst2 The second list of elements.
 * @return A new list that contains the intersection of the unique elements from both input lists.
 */
fun intersectionListFunctionCalls(lst1: List<Any>, lst2: List<Any>): List<Any> {
/**
 * This exercise aims to test your understanding of function calls and the 'in' operator.
 * You are required to write a function that takes two lists as arguments and returns a new list
 * containing the intersection of the unique elements from both lists.
 *
 * @param lst1 The first list of elements.
 * @param lst2 The second list of elements.
 * @return A new list that contains the intersection of the unique elements from both input lists.
 */
fun intersectionListFunctionCalls(lst1: List<Any>, lst2: List<Any>): List<Any> {

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

    // Iterate through each element in lst1
    for (element in lst1) {
        // Uniquely check if the element exists in both lst1 and lst2
        if (element in lst2 && element !in intersectionList) {
            intersectionList.add(element)
        }
    }

    // Return the intersection list
    return intersectionList
}