Swift code

100% efficient O(nlogn) time complexity

func solution(_ A: [Int]) -> Int {
    let sortedA = A.sorted()
    var min = 1

    for i in sortedA {
        if i == min {
            min += 1
        }
    }

    return min
}