/**
 * Given two sets mSet and nSet, return a new set that contains the intersection
 * of the two sets, excluding any elements that are divisible by 3.
 *
 * Hints:
 * - Use nested loops to iterate over both sets.
 * - Use the continue statement to skip the current iteration if the element is divisible by 3.
 * - Create an empty set to store the intersection and return it at the end.
 *
 * @param mSet A set of integers
 * @param nSet A set of integers
 * @return A set containing the intersection of mSet and nSet, excluding elements divisible by 3.
 */
fun intersectionWithContinue(mSet: Set<Int>, nSet: Set<Int>): Set<Int> {

    val intersection = mutableSetOf<Int>()

    for (mNum in mSet) {
        for (nNum in nSet) {
            if (mNum % 3 == 0 || nNum % 3 == 0) {
                continue
            }
            if (mNum == nNum) {
                intersection.add(mNum)
            }
        }
    }

    return intersection
}
/**
 * Given two sets mSet and nSet, return a new set that contains the intersection
 * of the two sets, excluding any elements that are divisible by 3.
 *
 * Hints:
 * - Use nested loops to iterate over both sets.
 * - Use the continue statement to skip the current iteration if the element is divisible by 3.
 * - Create an empty set to store the intersection and return it at the end.
 *
 * @param mSet A set of integers
 * @param nSet A set of integers
 * @return A set containing the intersection of mSet and nSet, excluding elements divisible by 3.
 */
fun intersectionWithContinue(mSet: Set<Int>, nSet: Set<Int>): Set<Int> {
/**
 * Given two sets mSet and nSet, return a new set that contains the intersection
 * of the two sets, excluding any elements that are divisible by 3.
 *
 * Hints:
 * - Use nested loops to iterate over both sets.
 * - Use the continue statement to skip the current iteration if the element is divisible by 3.
 * - Create an empty set to store the intersection and return it at the end.
 *
 * @param mSet A set of integers
 * @param nSet A set of integers
 * @return A set containing the intersection of mSet and nSet, excluding elements divisible by 3.
 */
fun intersectionWithContinue(mSet: Set<Int>, nSet: Set<Int>): Set<Int> {

    val intersection = mutableSetOf<Int>()

    for (mNum in mSet) {
        for (nNum in nSet) {
            if (mNum % 3 == 0 || nNum % 3 == 0) {
                continue
            }
            if (mNum == nNum) {
                intersection.add(mNum)
            }
        }
    }

    return intersection
}