/**
 * Your task is to implement a function that takes two sets as input arguments and returns a new set containing the common numbers between the two input sets.
 *
 * @param set1 The first set
 * @param set2 The second set
 * @return A new set containing common numbers between set1 and set2
 *
 * Example:
 * findCommonNumbers(setOf(1, 2, 3, 4), setOf(3, 4, 5, 6)) ➞ setOf(3, 4)
 * findCommonNumbers(setOf(10, 20, 30), setOf(40, 50, 60)) ➞ setOf()
 *
 * Note:
 * - The function should return an empty set if there are no common numbers between the two input sets.
 * - You can assume that the input sets only contain positive integers.
 */
fun findCommonNumbers(set1: Set<Int>, set2: Set<Int>): Set<Int> {

    val commonNumbers = mutableSetOf<Int>()

    for (number in set1) {
        if (number in set2) {
            commonNumbers.add(number)
        }
    }

    return commonNumbers
}
/**
 * Your task is to implement a function that takes two sets as input arguments and returns a new set containing the common numbers between the two input sets.
 *
 * @param set1 The first set
 * @param set2 The second set
 * @return A new set containing common numbers between set1 and set2
 *
 * Example:
 * findCommonNumbers(setOf(1, 2, 3, 4), setOf(3, 4, 5, 6)) ➞ setOf(3, 4)
 * findCommonNumbers(setOf(10, 20, 30), setOf(40, 50, 60)) ➞ setOf()
 *
 * Note:
 * - The function should return an empty set if there are no common numbers between the two input sets.
 * - You can assume that the input sets only contain positive integers.
 */
fun findCommonNumbers(set1: Set<Int>, set2: Set<Int>): Set<Int> {
/**
 * Your task is to implement a function that takes two sets as input arguments and returns a new set containing the common numbers between the two input sets.
 *
 * @param set1 The first set
 * @param set2 The second set
 * @return A new set containing common numbers between set1 and set2
 *
 * Example:
 * findCommonNumbers(setOf(1, 2, 3, 4), setOf(3, 4, 5, 6)) ➞ setOf(3, 4)
 * findCommonNumbers(setOf(10, 20, 30), setOf(40, 50, 60)) ➞ setOf()
 *
 * Note:
 * - The function should return an empty set if there are no common numbers between the two input sets.
 * - You can assume that the input sets only contain positive integers.
 */
fun findCommonNumbers(set1: Set<Int>, set2: Set<Int>): Set<Int> {

    val commonNumbers = mutableSetOf<Int>()

    for (number in set1) {
        if (number in set2) {
            commonNumbers.add(number)
        }
    }

    return commonNumbers
}