/**
 * This function takes a list of numbers and a target value, and returns the index
 * of the first occurrence of the target value in the list. If the target value
 * does not exist in the list, it returns -1.
 *
 * @param numbers A list of numbers
 * @param target The target value to find in the list
 * @return The index of the first occurrence of the target value in the list,
 * or -1 if the value is not found
 */
fun findIntersection(numbers: List<Int>, target: Int): Int {

    // Iterate over each number in the list
    for (i in numbers.indices) {
        // Check if the current number equals the target value
        if (numbers[i] == target) {
            return i  // Return the index if found
        }
    }
    return -1  // Return -1 if target value is not found
}
/**
 * This function takes a list of numbers and a target value, and returns the index
 * of the first occurrence of the target value in the list. If the target value
 * does not exist in the list, it returns -1.
 *
 * @param numbers A list of numbers
 * @param target The target value to find in the list
 * @return The index of the first occurrence of the target value in the list,
 * or -1 if the value is not found
 */
fun findIntersection(numbers: List<Int>, target: Int): Int {
/**
 * This function takes a list of numbers and a target value, and returns the index
 * of the first occurrence of the target value in the list. If the target value
 * does not exist in the list, it returns -1.
 *
 * @param numbers A list of numbers
 * @param target The target value to find in the list
 * @return The index of the first occurrence of the target value in the list,
 * or -1 if the value is not found
 */
fun findIntersection(numbers: List<Int>, target: Int): Int {

    // Iterate over each number in the list
    for (i in numbers.indices) {
        // Check if the current number equals the target value
        if (numbers[i] == target) {
            return i  // Return the index if found
        }
    }
    return -1  // Return -1 if target value is not found
}