/**
 * Given two lists of unique integers, find the intersection of the two lists.
 * Returns a new list containing the common elements between the two lists.
 */
fun findIntersection(firstList: List<Int>, secondList: List<Int>): List<Int> {

    // Initialize an empty set to store the common elements
    val intersection = mutableSetOf<Int>()

    // Iterate over the elements in the first list
    for (num in firstList) {
        // Check if the element is also present in the second list
        if (num in secondList) {
            // Add the common element to the intersection set
            intersection.add(num)
        }
    }

    // Return the intersection as a list
    return intersection.toList()
}
/**
 * Given two lists of unique integers, find the intersection of the two lists.
 * Returns a new list containing the common elements between the two lists.
 */
fun findIntersection(firstList: List<Int>, secondList: List<Int>): List<Int> {
/**
 * Given two lists of unique integers, find the intersection of the two lists.
 * Returns a new list containing the common elements between the two lists.
 */
fun findIntersection(firstList: List<Int>, secondList: List<Int>): List<Int> {

    // Initialize an empty set to store the common elements
    val intersection = mutableSetOf<Int>()

    // Iterate over the elements in the first list
    for (num in firstList) {
        // Check if the element is also present in the second list
        if (num in secondList) {
            // Add the common element to the intersection set
            intersection.add(num)
        }
    }

    // Return the intersection as a list
    return intersection.toList()
}