import scala.collection.JavaConversions._

// you can use println for debugging purposes, e.g.
// println("this is a debug message")

object Solution {
    def solution(A: Array[Int]): Int = {
        // First build set of integers that exist.
        @scala.annotation.tailrec
        def buildSet(index: Int, accum: Set[Int]): Set[Int] = {
            if (index >= A.length) accum
            else {
                val nextValue = A(index)
                val nextAccum = 
                    if (nextValue > 0) accum + nextValue
                    else accum
                buildSet(index + 1, nextAccum)
            }
        }
        val positiveValues = buildSet(0, Set.empty)
        
        // Next find lowest number not in set.
        @scala.annotation.tailrec
        def findLowest(i: Int): Int = {
            if (positiveValues contains i) findLowest(i + 1)
            else i
        }
        
        findLowest(1)
    }
}

import scala.collection.JavaConversions._

// you can use println for debugging purposes, e.g.
// println("this is a debug message")

object Solution {
    def solution(A: Array[Int]): Int = {
        // First build set of integers that exist.
        @scala.annotation.tailrec
        def buildSet(index: Int, accum: Set[Int]): Set[Int] = {
            if (index >= A.length) accum
            else {
                val nextValue = A(index)
                val nextAccum = 
                    if (nextValue > 0) accum + nextValue
                    else accum
                buildSet(index + 1, nextAccum)
            }
        }
        val positiveValues = buildSet(0, Set.empty)
        
        // Next find lowest number not in set.
        @scala.annotation.tailrec
        def findLowest(i: Int): Int = {
            if (positiveValues contains i) findLowest(i + 1)
            else i
        }
        
        findLowest(1)
    }
}

import scala.collection.JavaConversions._

// you can use println for debugging purposes, e.g.
// println("this is a debug message")

object Solution {
    def solution(A: Array[Int]): Int = {
        // First build set of integers that exist.
        @scala.annotation.tailrec
        def buildSet(index: Int, accum: Set[Int]): Set[Int] = {
            if (index >= A.length) accum
            else {
                val nextValue = A(index)
                val nextAccum = 
                    if (nextValue > 0) accum + nextValue
                    else accum
                buildSet(index + 1, nextAccum)
            }
        }
        val positiveValues = buildSet(0, Set.empty)
        
        // Next find lowest number not in set.
        @scala.annotation.tailrec
        def findLowest(i: Int): Int = {
            if (positiveValues contains i) findLowest(i + 1)
            else i
        }
        
        findLowest(1)
    }
}