Untitled

fun solution(R: Array<String>): Int {
    val n = R.size
    val m = R[0].length
    val directions = listOf(Pair(0, 1), Pair(1, 0), Pair(0, -1), Pair(-1, 0))
    var directionIndex = 0 // Starts facing right
    var x = 0
    var y = 0
    val visited = mutableSetOf<Pair<Int, Int>>()
    
    while (true) {
        visited.add(Pair(x, y))
        
        var moved = false
        for (i in 0 until 4) { // Try all four directions before stopping
            val (dx, dy) = directions[directionIndex]
            val nx = x + dx
            val ny = y + dy
            
            if (nx in 0 until n && ny in 0 until m && R[nx][ny] == '.' && Pair(nx, ny) !in visited) {
                x = nx
                y = ny
                moved = true
                break
            } else {
                directionIndex = (directionIndex + 1) % 4 // Rotate 90 degrees clockwise
            }
        }
        
        if (!moved) break // Stop if no valid move is possible
    }
    
    return visited.size
}