Alternative colored path BFS in Kotlin

https://leetcode.com/problems/shortest-path-with-alternating-colors/

fun shortestAlternatingPaths(n: Int, red_edges: Array<IntArray>, blue_edges: Array<IntArray>): IntArray {
    val answer : Array<IntArray> = Array(2){IntArray(n)}
    val finalAnswer = IntArray(n)
    for (i in 1 until n) {
        answer[0][i] = 2*n
        answer[1][i] = 2*n
    }
    val queue: Queue<Int> = ArrayDeque()
    queue.offer(0)

    while (!queue.isEmpty()) {
        val current = queue.remove()
        for (edge in red_edges) {
            if (edge[0] == current) {
                if (answer[0][edge[1]] > answer[1][edge[0]]+1) {
                    answer[0][edge[1]] = answer[1][edge[0]]+1
                    queue.offer(edge[1])
                }
            }
        }
        for (edge in blue_edges) {
            if (edge[0] == current) {
                if (answer[1][edge[1]] > answer[0][edge[0]]+1) {
                    answer[1][edge[1]] = answer[0][edge[0]]+1
                    queue.offer(edge[1])
                }
            }
        }
    }
    answer[0].forEachIndexed{
            index, _ ->  finalAnswer[index] = Math.min(answer[0][index], answer[1][index])
    }
    return finalAnswer
}