/**
 * Given two lists, find the unique elements that are present in both lists and return them as a set.
 *
 * @param lst1 the first list
 * @param lst2 the second list
 * @return A set containing the unique elements present in both lists.
 */
fun findUniqueElements(lst1: List<Any>, lst2: List<Any>): Set<Any> {

    // Check if both lists are empty
    if (lst1.isEmpty() && lst2.isEmpty()) {
        return emptySet()
    }

    // Convert lists to sets
    val set1 = lst1.toSet()
    val set2 = lst2.toSet()

    // Find the intersection of the two sets
    val intersection = set1.intersect(set2)

    return intersection
}
/**
 * Given two lists, find the unique elements that are present in both lists and return them as a set.
 *
 * @param lst1 the first list
 * @param lst2 the second list
 * @return A set containing the unique elements present in both lists.
 */
fun findUniqueElements(lst1: List<Any>, lst2: List<Any>): Set<Any> {
/**
 * Given two lists, find the unique elements that are present in both lists and return them as a set.
 *
 * @param lst1 the first list
 * @param lst2 the second list
 * @return A set containing the unique elements present in both lists.
 */
fun findUniqueElements(lst1: List<Any>, lst2: List<Any>): Set<Any> {

    // Check if both lists are empty
    if (lst1.isEmpty() && lst2.isEmpty()) {
        return emptySet()
    }

    // Convert lists to sets
    val set1 = lst1.toSet()
    val set2 = lst2.toSet()

    // Find the intersection of the two sets
    val intersection = set1.intersect(set2)

    return intersection
}