class SubArray {

    fun getLengthOfLongestContiguousSubarray(array: Array<Int>): Int {
        var maxLength = 1
        for (i in 0 until array.size - 1) {
            var minimum = array[i]
            var maximum = array[i]

            for (j in i + 1 until array.size) {
                minimum = Math.min(minimum, array[j])
                maximum = Math.max(maximum, array[j])

                if (maximum - minimum == j - i) {
                    maxLength = Math.max(maxLength, maximum - minimum + 1)
                }
            }
        }
        return maxLength
    }

    fun getSmallestPositiveNumber(array: Array<Int>): Int {
        var result = 1
        var i = 0
        while (i < array.size && array[i] <= result) {
            result += array[i]
            i++
        }
        return result
    }

    fun getSmallestSubarrayWithSumGreaterThanValue(array: Array<Int>, value: Int): Int {
        var minLength = array.size + 1

        for (start in 0 until array.size) {
            // Initialize sum starting with current start
            var sum = array[start]

            // If first element itself is greater
            if (sum > value) {
                return 1
            }

            for (end in start + 1 until array.size) {
                sum += array[end]

                // If sum becomes more than x and length of
                // this subarray is smaller than current smallest
                // length, update the smallest length (or result)
                val length = end - start + 1
                if (sum > value && length < minLength) {
                    minLength = length
                }
            }
        }
        return minLength
    }
}

class SubArray {

    fun getLengthOfLongestContiguousSubarray(array: Array<Int>): Int {
        var maxLength = 1
        for (i in 0 until array.size - 1) {
            var minimum = array[i]
            var maximum = array[i]

            for (j in i + 1 until array.size) {
                minimum = Math.min(minimum, array[j])
                maximum = Math.max(maximum, array[j])

                if (maximum - minimum == j - i) {
                    maxLength = Math.max(maxLength, maximum - minimum + 1)
                }
            }
        }
        return maxLength
    }

    fun getSmallestPositiveNumber(array: Array<Int>): Int {
        var result = 1
        var i = 0
        while (i < array.size && array[i] <= result) {
            result += array[i]
            i++
        }
        return result
    }

    fun getSmallestSubarrayWithSumGreaterThanValue(array: Array<Int>, value: Int): Int {
        var minLength = array.size + 1

        for (start in 0 until array.size) {
            // Initialize sum starting with current start
            var sum = array[start]

            // If first element itself is greater
            if (sum > value) {
                return 1
            }

            for (end in start + 1 until array.size) {
                sum += array[end]

                // If sum becomes more than x and length of
                // this subarray is smaller than current smallest
                // length, update the smallest length (or result)
                val length = end - start + 1
                if (sum > value && length < minLength) {
                    minLength = length
                }
            }
        }
        return minLength
    }
}
