func hasCloseElements(numbers: [Double], threshold: Double) -> Bool {
    guard numbers.count > 1 else { return false }
    let sortedNumbers = numbers.sorted()
    let diff = sortedNumbers.dropFirst().map { $0 - sortedNumbers[$0.index - 1] }
    return diff.contains { $0 < threshold }
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Check if in given array of numbers, are any two numbers closer to each other than
given threshold.
hasCloseElements(numbers: [1.0, 2.0, 3.0], threshold: 0.5) == false
hasCloseElements(numbers: [1.0, 2.8, 3.0, 4.0, 5.0, 2.0], threshold: 0.3) == true
### Response:
```swift
func hasCloseElements(numbers: [Double], threshold: Double) -> Bool {
    guard numbers.count > 1 else { return false }
    let sortedNumbers = numbers.sorted()
    let diff = sortedNumbers.dropFirst().map { $0 - sortedNumbers[$0.index - 1] }
    return diff.contains { $0 < threshold }
}
```

func hasCloseElements(numbers: [Double], threshold: Double) -> Bool {
    guard numbers.count > 1 else { return false }
    let sortedNumbers = numbers.sorted()
    let diff = sortedNumbers.dropFirst().map { $0 - sortedNumbers[$0.index - 1] }
    return diff.contains { $0 < threshold }
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Check if in given array of numbers, are any two numbers closer to each other than
given threshold.
hasCloseElements(numbers: [1.0, 2.0, 3.0], threshold: 0.5) == false
hasCloseElements(numbers: [1.0, 2.8, 3.0, 4.0, 5.0, 2.0], threshold: 0.3) == true
### Response:
```swift
func hasCloseElements(numbers: [Double], threshold: Double) -> Bool {
    guard numbers.count > 1 else { return false }
    let sortedNumbers = numbers.sorted()
    let diff = sortedNumbers.dropFirst().map { $0 - sortedNumbers[$0.index - 1] }
    return diff.contains { $0 < threshold }
}
```

func hasCloseElements(numbers: [Double], threshold: Double) -> Bool {
    guard numbers.count > 1 else { return false }
    let sortedNumbers = numbers.sorted()
    let diff = sortedNumbers.dropFirst().map { $0 - sortedNumbers[$0.index - 1] }
    return diff.contains { $0 < threshold }
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Check if in given array of numbers, are any two numbers closer to each other than
given threshold.
hasCloseElements(numbers: [1.0, 2.0, 3.0], threshold: 0.5) == false
hasCloseElements(numbers: [1.0, 2.8, 3.0, 4.0, 5.0, 2.0], threshold: 0.3) == true
### Response:
```swift
func hasCloseElements(numbers: [Double], threshold: Double) -> Bool {
    guard numbers.count > 1 else { return false }
    let sortedNumbers = numbers.sorted()
    let diff = sortedNumbers.dropFirst().map { $0 - sortedNumbers[$0.index - 1] }
    return diff.contains { $0 < threshold }
}
```

func hasCloseElements(numbers: [Double], threshold: Double) -> Bool {
    guard numbers.count > 1 else { return false }
    let sortedNumbers = numbers.sorted()
    let diff = sortedNumbers.dropFirst().map { $0 - sortedNumbers[$0.index - 1] }
    return diff.contains { $0 < threshold }
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Check if in given array of numbers, are any two numbers closer to each other than
given threshold.
hasCloseElements(numbers: [1.0, 2.0, 3.0], threshold: 0.5) == false
hasCloseElements(numbers: [1.0, 2.8, 3.0, 4.0, 5.0, 2.0], threshold: 0.3) == true
### Response:
```swift
func hasCloseElements(numbers: [Double], threshold: Double) -> Bool {
    guard numbers.count > 1 else { return false }
    let sortedNumbers = numbers.sorted()
    let diff = sortedNumbers.dropFirst().map { $0 - sortedNumbers[$0.index - 1] }
    return diff.contains { $0 < threshold }
}
```

func hasCloseElements(numbers: [Double], threshold: Double) -> Bool {
    guard numbers.count > 1 else { return false }
    let sortedNumbers = numbers.sorted()
    let diff = sortedNumbers.dropFirst().map { $0 - sortedNumbers[$0.index - 1] }
    return diff.contains { $0 < threshold }
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Check if in given array of numbers, are any two numbers closer to each other than
given threshold.
hasCloseElements(numbers: [1.0, 2.0, 3.0], threshold: 0.5) == false
hasCloseElements(numbers: [1.0, 2.8, 3.0, 4.0, 5.0, 2.0], threshold: 0.3) == true
### Response:
```swift
func hasCloseElements(numbers: [Double], threshold: Double) -> Bool {
    guard numbers.count > 1 else { return false }
    let sortedNumbers = numbers.sorted()
    let diff = sortedNumbers.dropFirst().map { $0 - sortedNumbers[$0.index - 1] }
    return diff.contains { $0 < threshold }
}
```

func hasCloseElements(numbers: [Double], threshold: Double) -> Bool {
    guard numbers.count > 1 else { return false }
    let sortedNumbers = numbers.sorted()
    let diff = sortedNumbers.dropFirst().map { $0 - sortedNumbers[$0.index - 1] }
    return diff.contains { $0 < threshold }
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Check if in given array of numbers, are any two numbers closer to each other than
given threshold.
hasCloseElements(numbers: [1.0, 2.0, 3.0], threshold: 0.5) == false
hasCloseElements(numbers: [1.0, 2.8, 3.0, 4.0, 5.0, 2.0], threshold: 0.3) == true
### Response:
```swift
func hasCloseElements(numbers: [Double], threshold: Double) -> Bool {
    guard numbers.count > 1 else { return false }
    let sortedNumbers = numbers.sorted()
    let diff = sortedNumbers.dropFirst().map { $0 - sortedNumbers[$0.index - 1] }
    return diff.contains { $0 < threshold }
}
```

func hasCloseElements(numbers: [Double], threshold: Double) -> Bool {
    guard numbers.count > 1 else { return false }
    let sortedNumbers = numbers.sorted()
    let diff = sortedNumbers.dropFirst().map { $0 - sortedNumbers[$0.index - 1] }
    return diff.contains { $0 < threshold }
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Check if in given array of numbers, are any two numbers closer to each other than
given threshold.
hasCloseElements(numbers: [1.0, 2.0, 3.0], threshold: 0.5) == false
hasCloseElements(numbers: [1.0, 2.8, 3.0, 4.0, 5.0, 2.0], threshold: 0.3) == true
### Response:
```swift
func hasCloseElements(numbers: [Double], threshold: Double) -> Bool {
    guard numbers.count > 1 else { return false }
    let sortedNumbers = numbers.sorted()
    let diff = sortedNumbers.dropFirst().map { $0 - sortedNumbers[$0.index - 1] }
    return diff.contains { $0 < threshold }
}
```

func hasCloseElements(numbers: [Double], threshold: Double) -> Bool {
    for i in 0..<numbers.count {
        for j in i+1..<numbers.count {
            if abs(numbers[i] - numbers[j]) < threshold {
                return true
            }
        }
    }
    return false
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Check if in given array of numbers, are any two numbers closer to each other than
given threshold.
hasCloseElements(numbers: [1.0, 2.0, 3.0], threshold: 0.5) == false
hasCloseElements(numbers: [1.0, 2.8, 3.0, 4.0, 5.0, 2.0], threshold: 0.3) == true
### Response:
```swift
func hasCloseElements(numbers: [Double], threshold: Double) -> Bool {
    for i in 0..<numbers.count {
        for j in i+1..<numbers.count {
            if abs(numbers[i] - numbers[j]) < threshold {
                return true
            }
        }
    }
    return false
}
```

func hasCloseElements(numbers: [Double], threshold: Double) -> Bool {
    for i in 0..<numbers.count {
        for j in i+1..<numbers.count {
            if abs(numbers[i] - numbers[j]) < threshold {
                return true
            }
        }
    }
    return false
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Check if in given array of numbers, are any two numbers closer to each other than
given threshold.
hasCloseElements(numbers: [1.0, 2.0, 3.0], threshold: 0.5) == false
hasCloseElements(numbers: [1.0, 2.8, 3.0, 4.0, 5.0, 2.0], threshold: 0.3) == true
### Response:
```swift
func hasCloseElements(numbers: [Double], threshold: Double) -> Bool {
    for i in 0..<numbers.count {
        for j in i+1..<numbers.count {
            if abs(numbers[i] - numbers[j]) < threshold {
                return true
            }
        }
    }
    return false
}
```

func hasCloseElements(numbers: [Double], threshold: Double) -> Bool {
    guard numbers.count > 1 else { return false }
    let sortedNumbers = numbers.sorted()
    for i in 0..<sortedNumbers.count - 1 {
        if sortedNumbers[i + 1] - sortedNumbers[i] < threshold {
            return true
        }
    }
    return false
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Check if in given array of numbers, are any two numbers closer to each other than
given threshold.
hasCloseElements(numbers: [1.0, 2.0, 3.0], threshold: 0.5) == false
hasCloseElements(numbers: [1.0, 2.8, 3.0, 4.0, 5.0, 2.0], threshold: 0.3) == true
### Response:
```swift
func hasCloseElements(numbers: [Double], threshold: Double) -> Bool {
    guard numbers.count > 1 else { return false }
    let sortedNumbers = numbers.sorted()
    for i in 0..<sortedNumbers.count - 1 {
        if sortedNumbers[i + 1] - sortedNumbers[i] < threshold {
            return true
        }
    }
    return false
}
```

func separateParenGroups(parenString: String) -> [String] {
    var result = [String]()
    var current = ""
    var index = 0
    while index < parenString.count {
        let char = parenString[parenString.index(parenString.startIndex, offsetBy: index)]
        if char == "(" {
            current.append(char)
            index += 1
            while index < parenString.count {
                let char = parenString[parenString.index(parenString.startIndex, offsetBy: index)]
                if char == ")" {
                    current.append(char)
                    index += 1
                    break
                } else {
                    current.append(char)
                    index += 1
                }
            }
            result.append(current)
            current = ""
        } else {
            index += 1
        }
    }
    return result
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Input to this function is a string containing multiple groups of nested parentheses. Your goal is to
separate those group into separate strings and return the array of those.
Separate groups are balanced (each open brace is properly closed) and not nested within each other
Ignore any spaces in the input string.
separateParenGroups(parenString: "( ) (( )) (( )( ))") == ["()", "(())", "(()())"]
### Response:
```swift
func separateParenGroups(parenString: String) -> [String] {
    var result = [String]()
    var current = ""
    var index = 0
    while index < parenString.count {
        let char = parenString[parenString.index(parenString.startIndex, offsetBy: index)]
        if char == "(" {
            current.append(char)
            index += 1
            while index < parenString.count {
                let char = parenString[parenString.index(parenString.startIndex, offsetBy: index)]
                if char == ")" {
                    current.append(char)
                    index += 1
                    break
                } else {
                    current.append(char)
                    index += 1
                }
            }
            result.append(current)
            current = ""
        } else {
            index += 1
        }
    }
    return result
}
```

func separateParenGroups(parenString: String) -> [String] {
    var result: [String] = []
    var currentString: String = ""
    var isOpen: Bool = false
    for char in parenString {
        if char == "(" {
            isOpen = true
        } else if char == ")" {
            isOpen = false
        }
        if isOpen {
            currentString.append(char)
        } else if !currentString.isEmpty {
            result.append(currentString)
            currentString = ""
        }
    }
    return result
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Input to this function is a string containing multiple groups of nested parentheses. Your goal is to
separate those group into separate strings and return the array of those.
Separate groups are balanced (each open brace is properly closed) and not nested within each other
Ignore any spaces in the input string.
separateParenGroups(parenString: "( ) (( )) (( )( ))") == ["()", "(())", "(()())"]
### Response:
```swift
func separateParenGroups(parenString: String) -> [String] {
    var result: [String] = []
    var currentString: String = ""
    var isOpen: Bool = false
    for char in parenString {
        if char == "(" {
            isOpen = true
        } else if char == ")" {
            isOpen = false
        }
        if isOpen {
            currentString.append(char)
        } else if !currentString.isEmpty {
            result.append(currentString)
            currentString = ""
        }
    }
    return result
}
```

func separateParenGroups(parenString: String) -> [String] {
    var result = [String]()
    var current = ""
    var isOpen = false
    for char in parenString {
        if char == " " {
            continue
        }
        if char == "(" {
            isOpen = true
        } else if char == ")" {
            isOpen = false
        }
        if isOpen {
            current.append(char)
        } else if !current.isEmpty {
            result.append(current)
            current = ""
        }
    }
    return result
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Input to this function is a string containing multiple groups of nested parentheses. Your goal is to
separate those group into separate strings and return the array of those.
Separate groups are balanced (each open brace is properly closed) and not nested within each other
Ignore any spaces in the input string.
separateParenGroups(parenString: "( ) (( )) (( )( ))") == ["()", "(())", "(()())"]
### Response:
```swift
func separateParenGroups(parenString: String) -> [String] {
    var result = [String]()
    var current = ""
    var isOpen = false
    for char in parenString {
        if char == " " {
            continue
        }
        if char == "(" {
            isOpen = true
        } else if char == ")" {
            isOpen = false
        }
        if isOpen {
            current.append(char)
        } else if !current.isEmpty {
            result.append(current)
            current = ""
        }
    }
    return result
}
```

func separateParenGroups(parenString: String) -> [String] {
    var result = [String]()
    var current = ""
    var count = 0
    for char in parenString {
        if char == "(" {
            count += 1
        } else if char == ")" {
            count -= 1
        }
        if count == 0 {
            result.append(current)
            current = ""
        } else {
            current.append(char)
        }
    }
    return result
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Input to this function is a string containing multiple groups of nested parentheses. Your goal is to
separate those group into separate strings and return the array of those.
Separate groups are balanced (each open brace is properly closed) and not nested within each other
Ignore any spaces in the input string.
separateParenGroups(parenString: "( ) (( )) (( )( ))") == ["()", "(())", "(()())"]
### Response:
```swift
func separateParenGroups(parenString: String) -> [String] {
    var result = [String]()
    var current = ""
    var count = 0
    for char in parenString {
        if char == "(" {
            count += 1
        } else if char == ")" {
            count -= 1
        }
        if count == 0 {
            result.append(current)
            current = ""
        } else {
            current.append(char)
        }
    }
    return result
}
```

func separateParenGroups(parenString: String) -> [String] {
    var result = [String]()
    var current = ""
    var isOpen = false
    for char in parenString {
        switch char {
        case "(":
            isOpen = true
        case ")":
            isOpen = false
        default:
            break
        }
        if isOpen {
            current.append(char)
        } else if !current.isEmpty {
            result.append(current)
            current = ""
        }
    }
    return result
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Input to this function is a string containing multiple groups of nested parentheses. Your goal is to
separate those group into separate strings and return the array of those.
Separate groups are balanced (each open brace is properly closed) and not nested within each other
Ignore any spaces in the input string.
separateParenGroups(parenString: "( ) (( )) (( )( ))") == ["()", "(())", "(()())"]
### Response:
```swift
func separateParenGroups(parenString: String) -> [String] {
    var result = [String]()
    var current = ""
    var isOpen = false
    for char in parenString {
        switch char {
        case "(":
            isOpen = true
        case ")":
            isOpen = false
        default:
            break
        }
        if isOpen {
            current.append(char)
        } else if !current.isEmpty {
            result.append(current)
            current = ""
        }
    }
    return result
}
```

func separateParenGroups(parenString: String) -> [String] {
    var result = [String]()
    var current = ""
    var index = 0
    while index < parenString.count {
        let char = parenString[parenString.index(parenString.startIndex, offsetBy: index)]
        if char == "(" {
            current.append(char)
            index += 1
            while index < parenString.count {
                let char = parenString[parenString.index(parenString.startIndex, offsetBy: index)]
                if char == ")" {
                    current.append(char)
                    result.append(current)
                    current = ""
                    index += 1
                    break
                } else {
                    current.append(char)
                    index += 1
                }
            }
        } else {
            index += 1
        }
    }
    return result
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Input to this function is a string containing multiple groups of nested parentheses. Your goal is to
separate those group into separate strings and return the array of those.
Separate groups are balanced (each open brace is properly closed) and not nested within each other
Ignore any spaces in the input string.
separateParenGroups(parenString: "( ) (( )) (( )( ))") == ["()", "(())", "(()())"]
### Response:
```swift
func separateParenGroups(parenString: String) -> [String] {
    var result = [String]()
    var current = ""
    var index = 0
    while index < parenString.count {
        let char = parenString[parenString.index(parenString.startIndex, offsetBy: index)]
        if char == "(" {
            current.append(char)
            index += 1
            while index < parenString.count {
                let char = parenString[parenString.index(parenString.startIndex, offsetBy: index)]
                if char == ")" {
                    current.append(char)
                    result.append(current)
                    current = ""
                    index += 1
                    break
                } else {
                    current.append(char)
                    index += 1
                }
            }
        } else {
            index += 1
        }
    }
    return result
}
```

func separateParenGroups(parenString: String) -> [String] {
    var result = [String]()
    var current = ""
    var index = 0
    while index < parenString.count {
        let char = parenString[parenString.index(parenString.startIndex, offsetBy: index)]
        if char == " " {
            index += 1
            continue
        }
        if char == "(" {
            current.append(char)
        } else if char == ")" {
            current.append(char)
            result.append(current)
            current = ""
        }
        index += 1
    }
    return result
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Input to this function is a string containing multiple groups of nested parentheses. Your goal is to
separate those group into separate strings and return the array of those.
Separate groups are balanced (each open brace is properly closed) and not nested within each other
Ignore any spaces in the input string.
separateParenGroups(parenString: "( ) (( )) (( )( ))") == ["()", "(())", "(()())"]
### Response:
```swift
func separateParenGroups(parenString: String) -> [String] {
    var result = [String]()
    var current = ""
    var index = 0
    while index < parenString.count {
        let char = parenString[parenString.index(parenString.startIndex, offsetBy: index)]
        if char == " " {
            index += 1
            continue
        }
        if char == "(" {
            current.append(char)
        } else if char == ")" {
            current.append(char)
            result.append(current)
            current = ""
        }
        index += 1
    }
    return result
}
```

func separateParenGroups(parenString: String) -> [String] {
    var result = [String]()
    var current = ""
    var isOpen = false
    for char in parenString {
        if char == " " {
            continue
        }
        if char == "(" {
            isOpen = true
        } else if char == ")" {
            isOpen = false
        }
        if isOpen {
            current.append(char)
        } else if !current.isEmpty {
            result.append(current)
            current = ""
        }
    }
    return result
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Input to this function is a string containing multiple groups of nested parentheses. Your goal is to
separate those group into separate strings and return the array of those.
Separate groups are balanced (each open brace is properly closed) and not nested within each other
Ignore any spaces in the input string.
separateParenGroups(parenString: "( ) (( )) (( )( ))") == ["()", "(())", "(()())"]
### Response:
```swift
func separateParenGroups(parenString: String) -> [String] {
    var result = [String]()
    var current = ""
    var isOpen = false
    for char in parenString {
        if char == " " {
            continue
        }
        if char == "(" {
            isOpen = true
        } else if char == ")" {
            isOpen = false
        }
        if isOpen {
            current.append(char)
        } else if !current.isEmpty {
            result.append(current)
            current = ""
        }
    }
    return result
}
```

func separateParenGroups(parenString: String) -> [String] {
    var result = [String]()
    var current = ""
    var index = parenString.startIndex
    while index < parenString.endIndex {
        let character = parenString[index]
        if character == "(" {
            current.append(character)
        } else if character == ")" {
            current.append(character)
            result.append(current)
            current = ""
        }
        index = parenString.index(after: index)
    }
    return result
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Input to this function is a string containing multiple groups of nested parentheses. Your goal is to
separate those group into separate strings and return the array of those.
Separate groups are balanced (each open brace is properly closed) and not nested within each other
Ignore any spaces in the input string.
separateParenGroups(parenString: "( ) (( )) (( )( ))") == ["()", "(())", "(()())"]
### Response:
```swift
func separateParenGroups(parenString: String) -> [String] {
    var result = [String]()
    var current = ""
    var index = parenString.startIndex
    while index < parenString.endIndex {
        let character = parenString[index]
        if character == "(" {
            current.append(character)
        } else if character == ")" {
            current.append(character)
            result.append(current)
            current = ""
        }
        index = parenString.index(after: index)
    }
    return result
}
```

func separateParenGroups(parenString: String) -> [String] {
    var result = [String]()
    var current = ""
    var isOpen = false
    for char in parenString {
        if char == " " {
            continue
        }
        if char == "(" {
            isOpen = true
        }
        if isOpen {
            current.append(char)
        } else {
            if !current.isEmpty {
                result.append(current)
                current = ""
            }
        }
        if char == ")" {
            isOpen = false
        }
    }
    if !current.isEmpty {
        result.append(current)
    }
    return result
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Input to this function is a string containing multiple groups of nested parentheses. Your goal is to
separate those group into separate strings and return the array of those.
Separate groups are balanced (each open brace is properly closed) and not nested within each other
Ignore any spaces in the input string.
separateParenGroups(parenString: "( ) (( )) (( )( ))") == ["()", "(())", "(()())"]
### Response:
```swift
func separateParenGroups(parenString: String) -> [String] {
    var result = [String]()
    var current = ""
    var isOpen = false
    for char in parenString {
        if char == " " {
            continue
        }
        if char == "(" {
            isOpen = true
        }
        if isOpen {
            current.append(char)
        } else {
            if !current.isEmpty {
                result.append(current)
                current = ""
            }
        }
        if char == ")" {
            isOpen = false
        }
    }
    if !current.isEmpty {
        result.append(current)
    }
    return result
}
```

func truncateNumber(number: Double) -> Double {
    return number - floor(number)
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Given a positive floating point number, it can be decomposed into
and integer part (largest integer smaller than given number) and decimals
(leftover part always smaller than 1).
Return the decimal part of the number.
truncateNumber(number: 3.5) == 0.5
### Response:
```swift
func truncateNumber(number: Double) -> Double {
    return number - floor(number)
}
```

func truncateNumber(number: Double) -> Double {
    return number - floor(number)
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Given a positive floating point number, it can be decomposed into
and integer part (largest integer smaller than given number) and decimals
(leftover part always smaller than 1).
Return the decimal part of the number.
truncateNumber(number: 3.5) == 0.5
### Response:
```swift
func truncateNumber(number: Double) -> Double {
    return number - floor(number)
}
```

func truncateNumber(number: Double) -> Double {
    return number - floor(number)
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Given a positive floating point number, it can be decomposed into
and integer part (largest integer smaller than given number) and decimals
(leftover part always smaller than 1).
Return the decimal part of the number.
truncateNumber(number: 3.5) == 0.5
### Response:
```swift
func truncateNumber(number: Double) -> Double {
    return number - floor(number)
}
```

func truncateNumber(number: Double) -> Double {
    return number - floor(number)
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Given a positive floating point number, it can be decomposed into
and integer part (largest integer smaller than given number) and decimals
(leftover part always smaller than 1).
Return the decimal part of the number.
truncateNumber(number: 3.5) == 0.5
### Response:
```swift
func truncateNumber(number: Double) -> Double {
    return number - floor(number)
}
```

func truncateNumber(number: Double) -> Double {
    return number - floor(number)
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Given a positive floating point number, it can be decomposed into
and integer part (largest integer smaller than given number) and decimals
(leftover part always smaller than 1).
Return the decimal part of the number.
truncateNumber(number: 3.5) == 0.5
### Response:
```swift
func truncateNumber(number: Double) -> Double {
    return number - floor(number)
}
```

func truncateNumber(number: Double) -> Double {
    return number - floor(number)
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Given a positive floating point number, it can be decomposed into
and integer part (largest integer smaller than given number) and decimals
(leftover part always smaller than 1).
Return the decimal part of the number.
truncateNumber(number: 3.5) == 0.5
### Response:
```swift
func truncateNumber(number: Double) -> Double {
    return number - floor(number)
}
```

func truncateNumber(number: Double) -> Double {
    return number - floor(number)
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Given a positive floating point number, it can be decomposed into
and integer part (largest integer smaller than given number) and decimals
(leftover part always smaller than 1).
Return the decimal part of the number.
truncateNumber(number: 3.5) == 0.5
### Response:
```swift
func truncateNumber(number: Double) -> Double {
    return number - floor(number)
}
```

func truncateNumber(number: Double) -> Double {
    return number - floor(number)
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Given a positive floating point number, it can be decomposed into
and integer part (largest integer smaller than given number) and decimals
(leftover part always smaller than 1).
Return the decimal part of the number.
truncateNumber(number: 3.5) == 0.5
### Response:
```swift
func truncateNumber(number: Double) -> Double {
    return number - floor(number)
}
```

func truncateNumber(number: Double) -> Double {
    return number - floor(number)
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Given a positive floating point number, it can be decomposed into
and integer part (largest integer smaller than given number) and decimals
(leftover part always smaller than 1).
Return the decimal part of the number.
truncateNumber(number: 3.5) == 0.5
### Response:
```swift
func truncateNumber(number: Double) -> Double {
    return number - floor(number)
}
```

func truncateNumber(number: Double) -> Double {
    return number - floor(number)
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Given a positive floating point number, it can be decomposed into
and integer part (largest integer smaller than given number) and decimals
(leftover part always smaller than 1).
Return the decimal part of the number.
truncateNumber(number: 3.5) == 0.5
### Response:
```swift
func truncateNumber(number: Double) -> Double {
    return number - floor(number)
}
```

func belowZero(operations: [Int]) -> Bool {
    var balance = 0
    for operation in operations {
        balance += operation
        if balance < 0 {
            return true
        }
    }
    return false
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
You're given an array of deposit and withdrawal operations on a bank account that starts with
zero balance. Your task is to detect if at any point the balance of account fallls below zero, and
at that point function should return true. Otherwise it should return false.
belowZero(operations: [1, 2, 3]) == false
belowZero(operations: [1, 2, -4, 5]) == true
### Response:
```swift
func belowZero(operations: [Int]) -> Bool {
    var balance = 0
    for operation in operations {
        balance += operation
        if balance < 0 {
            return true
        }
    }
    return false
}
```

func belowZero(operations: [Int]) -> Bool {
    var balance = 0
    for operation in operations {
        balance += operation
        if balance < 0 {
            return true
        }
    }
    return false
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
You're given an array of deposit and withdrawal operations on a bank account that starts with
zero balance. Your task is to detect if at any point the balance of account fallls below zero, and
at that point function should return true. Otherwise it should return false.
belowZero(operations: [1, 2, 3]) == false
belowZero(operations: [1, 2, -4, 5]) == true
### Response:
```swift
func belowZero(operations: [Int]) -> Bool {
    var balance = 0
    for operation in operations {
        balance += operation
        if balance < 0 {
            return true
        }
    }
    return false
}
```

func belowZero(operations: [Int]) -> Bool {
    var balance = 0
    for operation in operations {
        balance += operation
        if balance < 0 {
            return true
        }
    }
    return false
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
You're given an array of deposit and withdrawal operations on a bank account that starts with
zero balance. Your task is to detect if at any point the balance of account fallls below zero, and
at that point function should return true. Otherwise it should return false.
belowZero(operations: [1, 2, 3]) == false
belowZero(operations: [1, 2, -4, 5]) == true
### Response:
```swift
func belowZero(operations: [Int]) -> Bool {
    var balance = 0
    for operation in operations {
        balance += operation
        if balance < 0 {
            return true
        }
    }
    return false
}
```

func belowZero(operations: [Int]) -> Bool {
    var balance = 0
    for operation in operations {
        balance += operation
        if balance < 0 {
            return true
        }
    }
    return false
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
You're given an array of deposit and withdrawal operations on a bank account that starts with
zero balance. Your task is to detect if at any point the balance of account fallls below zero, and
at that point function should return true. Otherwise it should return false.
belowZero(operations: [1, 2, 3]) == false
belowZero(operations: [1, 2, -4, 5]) == true
### Response:
```swift
func belowZero(operations: [Int]) -> Bool {
    var balance = 0
    for operation in operations {
        balance += operation
        if balance < 0 {
            return true
        }
    }
    return false
}
```

func belowZero(operations: [Int]) -> Bool {
    var balance = 0
    for operation in operations {
        balance += operation
        if balance < 0 {
            return true
        }
    }
    return false
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
You're given an array of deposit and withdrawal operations on a bank account that starts with
zero balance. Your task is to detect if at any point the balance of account fallls below zero, and
at that point function should return true. Otherwise it should return false.
belowZero(operations: [1, 2, 3]) == false
belowZero(operations: [1, 2, -4, 5]) == true
### Response:
```swift
func belowZero(operations: [Int]) -> Bool {
    var balance = 0
    for operation in operations {
        balance += operation
        if balance < 0 {
            return true
        }
    }
    return false
}
```

func belowZero(operations: [Int]) -> Bool {
    var balance = 0
    for operation in operations {
        balance += operation
        if balance < 0 {
            return true
        }
    }
    return false
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
You're given an array of deposit and withdrawal operations on a bank account that starts with
zero balance. Your task is to detect if at any point the balance of account fallls below zero, and
at that point function should return true. Otherwise it should return false.
belowZero(operations: [1, 2, 3]) == false
belowZero(operations: [1, 2, -4, 5]) == true
### Response:
```swift
func belowZero(operations: [Int]) -> Bool {
    var balance = 0
    for operation in operations {
        balance += operation
        if balance < 0 {
            return true
        }
    }
    return false
}
```

func belowZero(operations: [Int]) -> Bool {
    var balance = 0
    for operation in operations {
        balance += operation
        if balance < 0 {
            return true
        }
    }
    return false
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
You're given an array of deposit and withdrawal operations on a bank account that starts with
zero balance. Your task is to detect if at any point the balance of account fallls below zero, and
at that point function should return true. Otherwise it should return false.
belowZero(operations: [1, 2, 3]) == false
belowZero(operations: [1, 2, -4, 5]) == true
### Response:
```swift
func belowZero(operations: [Int]) -> Bool {
    var balance = 0
    for operation in operations {
        balance += operation
        if balance < 0 {
            return true
        }
    }
    return false
}
```

func belowZero(operations: [Int]) -> Bool {
    var balance = 0
    for operation in operations {
        balance += operation
        if balance < 0 {
            return true
        }
    }
    return false
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
You're given an array of deposit and withdrawal operations on a bank account that starts with
zero balance. Your task is to detect if at any point the balance of account fallls below zero, and
at that point function should return true. Otherwise it should return false.
belowZero(operations: [1, 2, 3]) == false
belowZero(operations: [1, 2, -4, 5]) == true
### Response:
```swift
func belowZero(operations: [Int]) -> Bool {
    var balance = 0
    for operation in operations {
        balance += operation
        if balance < 0 {
            return true
        }
    }
    return false
}
```

func belowZero(operations: [Int]) -> Bool {
    var balance = 0
    for operation in operations {
        balance += operation
        if balance < 0 {
            return true
        }
    }
    return false
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
You're given an array of deposit and withdrawal operations on a bank account that starts with
zero balance. Your task is to detect if at any point the balance of account fallls below zero, and
at that point function should return true. Otherwise it should return false.
belowZero(operations: [1, 2, 3]) == false
belowZero(operations: [1, 2, -4, 5]) == true
### Response:
```swift
func belowZero(operations: [Int]) -> Bool {
    var balance = 0
    for operation in operations {
        balance += operation
        if balance < 0 {
            return true
        }
    }
    return false
}
```

func belowZero(operations: [Int]) -> Bool {
    var balance = 0
    for operation in operations {
        balance += operation
        if balance < 0 {
            return true
        }
    }
    return false
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
You're given an array of deposit and withdrawal operations on a bank account that starts with
zero balance. Your task is to detect if at any point the balance of account fallls below zero, and
at that point function should return true. Otherwise it should return false.
belowZero(operations: [1, 2, 3]) == false
belowZero(operations: [1, 2, -4, 5]) == true
### Response:
```swift
func belowZero(operations: [Int]) -> Bool {
    var balance = 0
    for operation in operations {
        balance += operation
        if balance < 0 {
            return true
        }
    }
    return false
}
```

func meanAbsoluteDeviation(numbers: [Double]) -> Double {
    let mean = numbers.reduce(0, +) / Double(numbers.count)
    let absoluteDifferences = numbers.map { abs($0 - mean) }
    return absoluteDifferences.reduce(0, +) / Double(absoluteDifferences.count)
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
For a given array of input numbers, calculate Mean Absolute Deviation
around the mean of this dataset.
Mean Absolute Deviation is the average absolute difference between each
element and a centerpoint (mean in this case):
MAD = average | x - x_mean |
meanAbsoluteDeviation(numbers: [1.0, 2.0, 3.0, 4.0]) == 1.0
### Response:
```swift
func meanAbsoluteDeviation(numbers: [Double]) -> Double {
    let mean = numbers.reduce(0, +) / Double(numbers.count)
    let absoluteDifferences = numbers.map { abs($0 - mean) }
    return absoluteDifferences.reduce(0, +) / Double(absoluteDifferences.count)
}
```

func meanAbsoluteDeviation(numbers: [Double]) -> Double {
    let mean = numbers.reduce(0, +) / Double(numbers.count)
    let absoluteDifferences = numbers.map { abs($0 - mean) }
    return absoluteDifferences.reduce(0, +) / Double(absoluteDifferences.count)
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
For a given array of input numbers, calculate Mean Absolute Deviation
around the mean of this dataset.
Mean Absolute Deviation is the average absolute difference between each
element and a centerpoint (mean in this case):
MAD = average | x - x_mean |
meanAbsoluteDeviation(numbers: [1.0, 2.0, 3.0, 4.0]) == 1.0
### Response:
```swift
func meanAbsoluteDeviation(numbers: [Double]) -> Double {
    let mean = numbers.reduce(0, +) / Double(numbers.count)
    let absoluteDifferences = numbers.map { abs($0 - mean) }
    return absoluteDifferences.reduce(0, +) / Double(absoluteDifferences.count)
}
```

func meanAbsoluteDeviation(numbers: [Double]) -> Double {
    let mean = numbers.reduce(0, +) / Double(numbers.count)
    return numbers.reduce(0) { $0 + abs($1 - mean) } / Double(numbers.count)
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
For a given array of input numbers, calculate Mean Absolute Deviation
around the mean of this dataset.
Mean Absolute Deviation is the average absolute difference between each
element and a centerpoint (mean in this case):
MAD = average | x - x_mean |
meanAbsoluteDeviation(numbers: [1.0, 2.0, 3.0, 4.0]) == 1.0
### Response:
```swift
func meanAbsoluteDeviation(numbers: [Double]) -> Double {
    let mean = numbers.reduce(0, +) / Double(numbers.count)
    return numbers.reduce(0) { $0 + abs($1 - mean) } / Double(numbers.count)
}
```

func meanAbsoluteDeviation(numbers: [Double]) -> Double {
    let mean = numbers.reduce(0, +) / Double(numbers.count)
    let deviation = numbers.map { abs($0 - mean) }
    return deviation.reduce(0, +) / Double(deviation.count)
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
For a given array of input numbers, calculate Mean Absolute Deviation
around the mean of this dataset.
Mean Absolute Deviation is the average absolute difference between each
element and a centerpoint (mean in this case):
MAD = average | x - x_mean |
meanAbsoluteDeviation(numbers: [1.0, 2.0, 3.0, 4.0]) == 1.0
### Response:
```swift
func meanAbsoluteDeviation(numbers: [Double]) -> Double {
    let mean = numbers.reduce(0, +) / Double(numbers.count)
    let deviation = numbers.map { abs($0 - mean) }
    return deviation.reduce(0, +) / Double(deviation.count)
}
```

func meanAbsoluteDeviation(numbers: [Double]) -> Double {
    let mean = numbers.reduce(0, +) / Double(numbers.count)
    let absoluteDifferences = numbers.map { abs($0 - mean) }
    return absoluteDifferences.reduce(0, +) / Double(absoluteDifferences.count)
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
For a given array of input numbers, calculate Mean Absolute Deviation
around the mean of this dataset.
Mean Absolute Deviation is the average absolute difference between each
element and a centerpoint (mean in this case):
MAD = average | x - x_mean |
meanAbsoluteDeviation(numbers: [1.0, 2.0, 3.0, 4.0]) == 1.0
### Response:
```swift
func meanAbsoluteDeviation(numbers: [Double]) -> Double {
    let mean = numbers.reduce(0, +) / Double(numbers.count)
    let absoluteDifferences = numbers.map { abs($0 - mean) }
    return absoluteDifferences.reduce(0, +) / Double(absoluteDifferences.count)
}
```

func meanAbsoluteDeviation(numbers: [Double]) -> Double {
    let mean = numbers.reduce(0, +) / Double(numbers.count)
    let absoluteDifferences = numbers.map { abs($0 - mean) }
    return absoluteDifferences.reduce(0, +) / Double(absoluteDifferences.count)
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
For a given array of input numbers, calculate Mean Absolute Deviation
around the mean of this dataset.
Mean Absolute Deviation is the average absolute difference between each
element and a centerpoint (mean in this case):
MAD = average | x - x_mean |
meanAbsoluteDeviation(numbers: [1.0, 2.0, 3.0, 4.0]) == 1.0
### Response:
```swift
func meanAbsoluteDeviation(numbers: [Double]) -> Double {
    let mean = numbers.reduce(0, +) / Double(numbers.count)
    let absoluteDifferences = numbers.map { abs($0 - mean) }
    return absoluteDifferences.reduce(0, +) / Double(absoluteDifferences.count)
}
```

func meanAbsoluteDeviation(numbers: [Double]) -> Double {
    let mean = numbers.reduce(0, +) / Double(numbers.count)
    let deviation = numbers.map { abs($0 - mean) }
    return deviation.reduce(0, +) / Double(deviation.count)
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
For a given array of input numbers, calculate Mean Absolute Deviation
around the mean of this dataset.
Mean Absolute Deviation is the average absolute difference between each
element and a centerpoint (mean in this case):
MAD = average | x - x_mean |
meanAbsoluteDeviation(numbers: [1.0, 2.0, 3.0, 4.0]) == 1.0
### Response:
```swift
func meanAbsoluteDeviation(numbers: [Double]) -> Double {
    let mean = numbers.reduce(0, +) / Double(numbers.count)
    let deviation = numbers.map { abs($0 - mean) }
    return deviation.reduce(0, +) / Double(deviation.count)
}
```

func meanAbsoluteDeviation(numbers: [Double]) -> Double {
    let mean = numbers.reduce(0, +) / Double(numbers.count)
    let absoluteDifferences = numbers.map { abs($0 - mean) }
    return absoluteDifferences.reduce(0, +) / Double(absoluteDifferences.count)
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
For a given array of input numbers, calculate Mean Absolute Deviation
around the mean of this dataset.
Mean Absolute Deviation is the average absolute difference between each
element and a centerpoint (mean in this case):
MAD = average | x - x_mean |
meanAbsoluteDeviation(numbers: [1.0, 2.0, 3.0, 4.0]) == 1.0
### Response:
```swift
func meanAbsoluteDeviation(numbers: [Double]) -> Double {
    let mean = numbers.reduce(0, +) / Double(numbers.count)
    let absoluteDifferences = numbers.map { abs($0 - mean) }
    return absoluteDifferences.reduce(0, +) / Double(absoluteDifferences.count)
}
```

func meanAbsoluteDeviation(numbers: [Double]) -> Double {
    let mean = numbers.reduce(0, +) / Double(numbers.count)
    return numbers.reduce(0) { $0 + abs($1 - mean) } / Double(numbers.count)
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
For a given array of input numbers, calculate Mean Absolute Deviation
around the mean of this dataset.
Mean Absolute Deviation is the average absolute difference between each
element and a centerpoint (mean in this case):
MAD = average | x - x_mean |
meanAbsoluteDeviation(numbers: [1.0, 2.0, 3.0, 4.0]) == 1.0
### Response:
```swift
func meanAbsoluteDeviation(numbers: [Double]) -> Double {
    let mean = numbers.reduce(0, +) / Double(numbers.count)
    return numbers.reduce(0) { $0 + abs($1 - mean) } / Double(numbers.count)
}
```

func meanAbsoluteDeviation(numbers: [Double]) -> Double {
    let mean = numbers.reduce(0, +) / Double(numbers.count)
    return numbers.reduce(0) { $0 + abs($1 - mean) } / Double(numbers.count)
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
For a given array of input numbers, calculate Mean Absolute Deviation
around the mean of this dataset.
Mean Absolute Deviation is the average absolute difference between each
element and a centerpoint (mean in this case):
MAD = average | x - x_mean |
meanAbsoluteDeviation(numbers: [1.0, 2.0, 3.0, 4.0]) == 1.0
### Response:
```swift
func meanAbsoluteDeviation(numbers: [Double]) -> Double {
    let mean = numbers.reduce(0, +) / Double(numbers.count)
    return numbers.reduce(0) { $0 + abs($1 - mean) } / Double(numbers.count)
}
```

func intersperse(numbers: [Int], delimeter: Int) -> [Int] {
    var result = [Int]()
    for number in numbers {
        result.append(number)
        result.append(delimeter)
    }
    return result
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Insert a number 'delimeter' between every two consecutive elements of input array `numbers'
intersperse(numbers: [] as [Int], delimeter: 4) == [] as [Int]
intersperse(numbers: [1, 2, 3], delimeter: 4) == [1, 4, 2, 4, 3]
### Response:
```swift
func intersperse(numbers: [Int], delimeter: Int) -> [Int] {
    var result = [Int]()
    for number in numbers {
        result.append(number)
        result.append(delimeter)
    }
    return result
}
```

func intersperse(numbers: [Int], delimeter: Int) -> [Int] {
    guard numbers.count > 0 else { return [] }
    var result = [Int]()
    result.append(numbers[0])
    for i in 1..<numbers.count {
        result.append(delimeter)
        result.append(numbers[i])
    }
    return result
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Insert a number 'delimeter' between every two consecutive elements of input array `numbers'
intersperse(numbers: [] as [Int], delimeter: 4) == [] as [Int]
intersperse(numbers: [1, 2, 3], delimeter: 4) == [1, 4, 2, 4, 3]
### Response:
```swift
func intersperse(numbers: [Int], delimeter: Int) -> [Int] {
    guard numbers.count > 0 else { return [] }
    var result = [Int]()
    result.append(numbers[0])
    for i in 1..<numbers.count {
        result.append(delimeter)
        result.append(numbers[i])
    }
    return result
}
```

func intersperse(numbers: [Int], delimeter: Int) -> [Int] {
    var result = [Int]()
    for number in numbers {
        result.append(number)
        result.append(delimeter)
    }
    return result
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Insert a number 'delimeter' between every two consecutive elements of input array `numbers'
intersperse(numbers: [] as [Int], delimeter: 4) == [] as [Int]
intersperse(numbers: [1, 2, 3], delimeter: 4) == [1, 4, 2, 4, 3]
### Response:
```swift
func intersperse(numbers: [Int], delimeter: Int) -> [Int] {
    var result = [Int]()
    for number in numbers {
        result.append(number)
        result.append(delimeter)
    }
    return result
}
```

func intersperse(numbers: [Int], delimeter: Int) -> [Int] {
    guard numbers.count > 0 else { return [] }
    var result = [Int]()
    for (index, number) in numbers.enumerated() {
        if index != numbers.count - 1 {
            result.append(contentsOf: [number, delimeter])
        } else {
            result.append(number)
        }
    }
    return result
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Insert a number 'delimeter' between every two consecutive elements of input array `numbers'
intersperse(numbers: [] as [Int], delimeter: 4) == [] as [Int]
intersperse(numbers: [1, 2, 3], delimeter: 4) == [1, 4, 2, 4, 3]
### Response:
```swift
func intersperse(numbers: [Int], delimeter: Int) -> [Int] {
    guard numbers.count > 0 else { return [] }
    var result = [Int]()
    for (index, number) in numbers.enumerated() {
        if index != numbers.count - 1 {
            result.append(contentsOf: [number, delimeter])
        } else {
            result.append(number)
        }
    }
    return result
}
```

func intersperse(numbers: [Int], delimeter: Int) -> [Int] {
    var result = [Int]()
    for number in numbers {
        result.append(number)
        result.append(delimeter)
    }
    return result.dropLast()
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Insert a number 'delimeter' between every two consecutive elements of input array `numbers'
intersperse(numbers: [] as [Int], delimeter: 4) == [] as [Int]
intersperse(numbers: [1, 2, 3], delimeter: 4) == [1, 4, 2, 4, 3]
### Response:
```swift
func intersperse(numbers: [Int], delimeter: Int) -> [Int] {
    var result = [Int]()
    for number in numbers {
        result.append(number)
        result.append(delimeter)
    }
    return result.dropLast()
}
```

func intersperse(numbers: [Int], delimeter: Int) -> [Int] {
    guard numbers.count > 0 else { return [] }
    var result = [Int]()
    for (index, number) in numbers.enumerated() {
        result.append(number)
        if index < numbers.count - 1 {
            result.append(delimeter)
        }
    }
    return result
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Insert a number 'delimeter' between every two consecutive elements of input array `numbers'
intersperse(numbers: [] as [Int], delimeter: 4) == [] as [Int]
intersperse(numbers: [1, 2, 3], delimeter: 4) == [1, 4, 2, 4, 3]
### Response:
```swift
func intersperse(numbers: [Int], delimeter: Int) -> [Int] {
    guard numbers.count > 0 else { return [] }
    var result = [Int]()
    for (index, number) in numbers.enumerated() {
        result.append(number)
        if index < numbers.count - 1 {
            result.append(delimeter)
        }
    }
    return result
}
```

func intersperse(numbers: [Int], delimeter: Int) -> [Int] {
    guard numbers.count > 0 else {
        return []
    }
    var result = [Int]()
    result.append(numbers[0])
    for i in 1..<numbers.count {
        result.append(delimeter)
        result.append(numbers[i])
    }
    return result
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Insert a number 'delimeter' between every two consecutive elements of input array `numbers'
intersperse(numbers: [] as [Int], delimeter: 4) == [] as [Int]
intersperse(numbers: [1, 2, 3], delimeter: 4) == [1, 4, 2, 4, 3]
### Response:
```swift
func intersperse(numbers: [Int], delimeter: Int) -> [Int] {
    guard numbers.count > 0 else {
        return []
    }
    var result = [Int]()
    result.append(numbers[0])
    for i in 1..<numbers.count {
        result.append(delimeter)
        result.append(numbers[i])
    }
    return result
}
```

func intersperse(numbers: [Int], delimeter: Int) -> [Int] {
    guard numbers.count > 0 else { return numbers }
    var result = [Int]()
    result.append(numbers[0])
    for i in 1..<numbers.count {
        result.append(delimeter)
        result.append(numbers[i])
    }
    return result
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Insert a number 'delimeter' between every two consecutive elements of input array `numbers'
intersperse(numbers: [] as [Int], delimeter: 4) == [] as [Int]
intersperse(numbers: [1, 2, 3], delimeter: 4) == [1, 4, 2, 4, 3]
### Response:
```swift
func intersperse(numbers: [Int], delimeter: Int) -> [Int] {
    guard numbers.count > 0 else { return numbers }
    var result = [Int]()
    result.append(numbers[0])
    for i in 1..<numbers.count {
        result.append(delimeter)
        result.append(numbers[i])
    }
    return result
}
```

func intersperse(numbers: [Int], delimeter: Int) -> [Int] {
    var result = [Int]()
    for number in numbers {
        result.append(number)
        result.append(delimeter)
    }
    return result
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Insert a number 'delimeter' between every two consecutive elements of input array `numbers'
intersperse(numbers: [] as [Int], delimeter: 4) == [] as [Int]
intersperse(numbers: [1, 2, 3], delimeter: 4) == [1, 4, 2, 4, 3]
### Response:
```swift
func intersperse(numbers: [Int], delimeter: Int) -> [Int] {
    var result = [Int]()
    for number in numbers {
        result.append(number)
        result.append(delimeter)
    }
    return result
}
```

func intersperse(numbers: [Int], delimeter: Int) -> [Int] {
    var result = [Int]()
    for number in numbers {
        result.append(number)
        result.append(delimeter)
    }
    return result.dropLast()
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Insert a number 'delimeter' between every two consecutive elements of input array `numbers'
intersperse(numbers: [] as [Int], delimeter: 4) == [] as [Int]
intersperse(numbers: [1, 2, 3], delimeter: 4) == [1, 4, 2, 4, 3]
### Response:
```swift
func intersperse(numbers: [Int], delimeter: Int) -> [Int] {
    var result = [Int]()
    for number in numbers {
        result.append(number)
        result.append(delimeter)
    }
    return result.dropLast()
}
```

func parseNestedParens(parenString: String) -> [Int] {
    var result = [Int]()
    var currentLevel = 0
    var maxLevel = 0
    for char in parenString {
        if char == "(" {
            currentLevel += 1
            if currentLevel > maxLevel {
                maxLevel = currentLevel
            }
        } else if char == ")" {
            currentLevel -= 1
        }
    }
    result.append(maxLevel)
    return result
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Input to this function is a string represented multiple groups for nested parentheses separated by spaces.
For each of the group, output the deepest level of nesting of parentheses.
E.g. (()()) has maximum two levels of nesting while ((())) has three.
parseNestedParens(parenString: "(()()) ((())) () ((())()())") == [2, 3, 1, 3]
### Response:
```swift
func parseNestedParens(parenString: String) -> [Int] {
    var result = [Int]()
    var currentLevel = 0
    var maxLevel = 0
    for char in parenString {
        if char == "(" {
            currentLevel += 1
            if currentLevel > maxLevel {
                maxLevel = currentLevel
            }
        } else if char == ")" {
            currentLevel -= 1
        }
    }
    result.append(maxLevel)
    return result
}
```

func parseNestedParens(parenString: String) -> [Int] {
    var result = [Int]()
    var currentLevel = 0
    var maxLevel = 0
    for char in parenString {
        switch char {
        case "(":
            currentLevel += 1
            maxLevel = max(maxLevel, currentLevel)
        case ")":
            currentLevel -= 1
        default:
            break
        }
    }
    result.append(maxLevel)
    return result
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Input to this function is a string represented multiple groups for nested parentheses separated by spaces.
For each of the group, output the deepest level of nesting of parentheses.
E.g. (()()) has maximum two levels of nesting while ((())) has three.
parseNestedParens(parenString: "(()()) ((())) () ((())()())") == [2, 3, 1, 3]
### Response:
```swift
func parseNestedParens(parenString: String) -> [Int] {
    var result = [Int]()
    var currentLevel = 0
    var maxLevel = 0
    for char in parenString {
        switch char {
        case "(":
            currentLevel += 1
            maxLevel = max(maxLevel, currentLevel)
        case ")":
            currentLevel -= 1
        default:
            break
        }
    }
    result.append(maxLevel)
    return result
}
```

func parseNestedParens(parenString: String) -> [Int] {
    var result = [Int]()
    var currentLevel = 0
    var maxLevel = 0
    for char in parenString {
        switch char {
        case "(":
            currentLevel += 1
            if currentLevel > maxLevel {
                maxLevel = currentLevel
            }
        case ")":
            currentLevel -= 1
        default:
            break
        }
    }
    result.append(maxLevel)
    return result
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Input to this function is a string represented multiple groups for nested parentheses separated by spaces.
For each of the group, output the deepest level of nesting of parentheses.
E.g. (()()) has maximum two levels of nesting while ((())) has three.
parseNestedParens(parenString: "(()()) ((())) () ((())()())") == [2, 3, 1, 3]
### Response:
```swift
func parseNestedParens(parenString: String) -> [Int] {
    var result = [Int]()
    var currentLevel = 0
    var maxLevel = 0
    for char in parenString {
        switch char {
        case "(":
            currentLevel += 1
            if currentLevel > maxLevel {
                maxLevel = currentLevel
            }
        case ")":
            currentLevel -= 1
        default:
            break
        }
    }
    result.append(maxLevel)
    return result
}
```

func parseNestedParens(parenString: String) -> [Int] {
    var result = [Int]()
    var currentLevel = 0
    var maxLevel = 0
    for char in parenString {
        switch char {
        case "(":
            currentLevel += 1
            if currentLevel > maxLevel {
                maxLevel = currentLevel
            }
        case ")":
            currentLevel -= 1
        default:
            break
        }
    }
    result.append(maxLevel)
    return result
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Input to this function is a string represented multiple groups for nested parentheses separated by spaces.
For each of the group, output the deepest level of nesting of parentheses.
E.g. (()()) has maximum two levels of nesting while ((())) has three.
parseNestedParens(parenString: "(()()) ((())) () ((())()())") == [2, 3, 1, 3]
### Response:
```swift
func parseNestedParens(parenString: String) -> [Int] {
    var result = [Int]()
    var currentLevel = 0
    var maxLevel = 0
    for char in parenString {
        switch char {
        case "(":
            currentLevel += 1
            if currentLevel > maxLevel {
                maxLevel = currentLevel
            }
        case ")":
            currentLevel -= 1
        default:
            break
        }
    }
    result.append(maxLevel)
    return result
}
```

func parseNestedParens(parenString: String) -> [Int] {
    var result: [Int] = []
    var currentLevel = 0
    var maxLevel = 0
    for char in parenString {
        if char == "(" {
            currentLevel += 1
            if currentLevel > maxLevel {
                maxLevel = currentLevel
            }
        } else if char == ")" {
            currentLevel -= 1
        }
    }
    result.append(maxLevel)
    return result
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Input to this function is a string represented multiple groups for nested parentheses separated by spaces.
For each of the group, output the deepest level of nesting of parentheses.
E.g. (()()) has maximum two levels of nesting while ((())) has three.
parseNestedParens(parenString: "(()()) ((())) () ((())()())") == [2, 3, 1, 3]
### Response:
```swift
func parseNestedParens(parenString: String) -> [Int] {
    var result: [Int] = []
    var currentLevel = 0
    var maxLevel = 0
    for char in parenString {
        if char == "(" {
            currentLevel += 1
            if currentLevel > maxLevel {
                maxLevel = currentLevel
            }
        } else if char == ")" {
            currentLevel -= 1
        }
    }
    result.append(maxLevel)
    return result
}
```

func parseNestedParens(parenString: String) -> [Int] {
    var result = [Int]()
    var currentLevel = 0
    var maxLevel = 0
    var isOpen = false
    for char in parenString {
        if char == "(" {
            isOpen = true
            currentLevel += 1
            if currentLevel > maxLevel {
                maxLevel = currentLevel
            }
        } else if char == ")" {
            isOpen = false
            currentLevel -= 1
        }
        if !isOpen {
            result.append(maxLevel)
            maxLevel = 0
        }
    }
    return result
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Input to this function is a string represented multiple groups for nested parentheses separated by spaces.
For each of the group, output the deepest level of nesting of parentheses.
E.g. (()()) has maximum two levels of nesting while ((())) has three.
parseNestedParens(parenString: "(()()) ((())) () ((())()())") == [2, 3, 1, 3]
### Response:
```swift
func parseNestedParens(parenString: String) -> [Int] {
    var result = [Int]()
    var currentLevel = 0
    var maxLevel = 0
    var isOpen = false
    for char in parenString {
        if char == "(" {
            isOpen = true
            currentLevel += 1
            if currentLevel > maxLevel {
                maxLevel = currentLevel
            }
        } else if char == ")" {
            isOpen = false
            currentLevel -= 1
        }
        if !isOpen {
            result.append(maxLevel)
            maxLevel = 0
        }
    }
    return result
}
```

func parseNestedParens(parenString: String) -> [Int] {
    var result = [Int]()
    var currentLevel = 0
    var maxLevel = 0
    for char in parenString {
        if char == "(" {
            currentLevel += 1
            if currentLevel > maxLevel {
                maxLevel = currentLevel
            }
        } else if char == ")" {
            currentLevel -= 1
        }
    }
    result.append(maxLevel)
    return result
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Input to this function is a string represented multiple groups for nested parentheses separated by spaces.
For each of the group, output the deepest level of nesting of parentheses.
E.g. (()()) has maximum two levels of nesting while ((())) has three.
parseNestedParens(parenString: "(()()) ((())) () ((())()())") == [2, 3, 1, 3]
### Response:
```swift
func parseNestedParens(parenString: String) -> [Int] {
    var result = [Int]()
    var currentLevel = 0
    var maxLevel = 0
    for char in parenString {
        if char == "(" {
            currentLevel += 1
            if currentLevel > maxLevel {
                maxLevel = currentLevel
            }
        } else if char == ")" {
            currentLevel -= 1
        }
    }
    result.append(maxLevel)
    return result
}
```

func parseNestedParens(parenString: String) -> [Int] {
    var result = [Int]()
    var level = 0
    var maxLevel = 0
    for char in parenString {
        if char == "(" {
            level += 1
            if level > maxLevel {
                maxLevel = level
            }
        } else if char == ")" {
            level -= 1
        }
    }
    result.append(maxLevel)
    return result
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Input to this function is a string represented multiple groups for nested parentheses separated by spaces.
For each of the group, output the deepest level of nesting of parentheses.
E.g. (()()) has maximum two levels of nesting while ((())) has three.
parseNestedParens(parenString: "(()()) ((())) () ((())()())") == [2, 3, 1, 3]
### Response:
```swift
func parseNestedParens(parenString: String) -> [Int] {
    var result = [Int]()
    var level = 0
    var maxLevel = 0
    for char in parenString {
        if char == "(" {
            level += 1
            if level > maxLevel {
                maxLevel = level
            }
        } else if char == ")" {
            level -= 1
        }
    }
    result.append(maxLevel)
    return result
}
```

func parseNestedParens(parenString: String) -> [Int] {
    var result = [Int]()
    var currentLevel = 0
    var maxLevel = 0
    for char in parenString {
        if char == "(" {
            currentLevel += 1
            if currentLevel > maxLevel {
                maxLevel = currentLevel
            }
        } else if char == ")" {
            currentLevel -= 1
        }
    }
    result.append(maxLevel)
    return result
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Input to this function is a string represented multiple groups for nested parentheses separated by spaces.
For each of the group, output the deepest level of nesting of parentheses.
E.g. (()()) has maximum two levels of nesting while ((())) has three.
parseNestedParens(parenString: "(()()) ((())) () ((())()())") == [2, 3, 1, 3]
### Response:
```swift
func parseNestedParens(parenString: String) -> [Int] {
    var result = [Int]()
    var currentLevel = 0
    var maxLevel = 0
    for char in parenString {
        if char == "(" {
            currentLevel += 1
            if currentLevel > maxLevel {
                maxLevel = currentLevel
            }
        } else if char == ")" {
            currentLevel -= 1
        }
    }
    result.append(maxLevel)
    return result
}
```

func parseNestedParens(parenString: String) -> [Int] {
    var result = [Int]()
    var currentLevel = 0
    var maxLevel = 0
    for char in parenString {
        if char == "(" {
            currentLevel += 1
            if currentLevel > maxLevel {
                maxLevel = currentLevel
            }
        } else if char == ")" {
            currentLevel -= 1
        }
    }
    result.append(maxLevel)
    return result
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Input to this function is a string represented multiple groups for nested parentheses separated by spaces.
For each of the group, output the deepest level of nesting of parentheses.
E.g. (()()) has maximum two levels of nesting while ((())) has three.
parseNestedParens(parenString: "(()()) ((())) () ((())()())") == [2, 3, 1, 3]
### Response:
```swift
func parseNestedParens(parenString: String) -> [Int] {
    var result = [Int]()
    var currentLevel = 0
    var maxLevel = 0
    for char in parenString {
        if char == "(" {
            currentLevel += 1
            if currentLevel > maxLevel {
                maxLevel = currentLevel
            }
        } else if char == ")" {
            currentLevel -= 1
        }
    }
    result.append(maxLevel)
    return result
}
```

func filterBySubstring(strings: [String], substring: String) -> [String] {
    return strings.filter { $0.contains(substring) }
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Filter an input array of strings only for ones that contain given substring
filterBySubstring(strings: [] as [String], substring: "a") == [] as [String]
filterBySubstring(strings: ["abc", "bacd", "cde", "array"], substring: "a") == ["abc", "bacd", "array"]
### Response:
```swift
func filterBySubstring(strings: [String], substring: String) -> [String] {
    return strings.filter { $0.contains(substring) }
}
```

func filterBySubstring(strings: [String], substring: String) -> [String] {
    return strings.filter { $0.contains(substring) }
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Filter an input array of strings only for ones that contain given substring
filterBySubstring(strings: [] as [String], substring: "a") == [] as [String]
filterBySubstring(strings: ["abc", "bacd", "cde", "array"], substring: "a") == ["abc", "bacd", "array"]
### Response:
```swift
func filterBySubstring(strings: [String], substring: String) -> [String] {
    return strings.filter { $0.contains(substring) }
}
```

func filterBySubstring(strings: [String], substring: String) -> [String] {
    return strings.filter { $0.contains(substring) }
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Filter an input array of strings only for ones that contain given substring
filterBySubstring(strings: [] as [String], substring: "a") == [] as [String]
filterBySubstring(strings: ["abc", "bacd", "cde", "array"], substring: "a") == ["abc", "bacd", "array"]
### Response:
```swift
func filterBySubstring(strings: [String], substring: String) -> [String] {
    return strings.filter { $0.contains(substring) }
}
```

func filterBySubstring(strings: [String], substring: String) -> [String] {
    return strings.filter { $0.contains(substring) }
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Filter an input array of strings only for ones that contain given substring
filterBySubstring(strings: [] as [String], substring: "a") == [] as [String]
filterBySubstring(strings: ["abc", "bacd", "cde", "array"], substring: "a") == ["abc", "bacd", "array"]
### Response:
```swift
func filterBySubstring(strings: [String], substring: String) -> [String] {
    return strings.filter { $0.contains(substring) }
}
```

func filterBySubstring(strings: [String], substring: String) -> [String] {
    return strings.filter { $0.contains(substring) }
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Filter an input array of strings only for ones that contain given substring
filterBySubstring(strings: [] as [String], substring: "a") == [] as [String]
filterBySubstring(strings: ["abc", "bacd", "cde", "array"], substring: "a") == ["abc", "bacd", "array"]
### Response:
```swift
func filterBySubstring(strings: [String], substring: String) -> [String] {
    return strings.filter { $0.contains(substring) }
}
```

func filterBySubstring(strings: [String], substring: String) -> [String] {
    return strings.filter { $0.contains(substring) }
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Filter an input array of strings only for ones that contain given substring
filterBySubstring(strings: [] as [String], substring: "a") == [] as [String]
filterBySubstring(strings: ["abc", "bacd", "cde", "array"], substring: "a") == ["abc", "bacd", "array"]
### Response:
```swift
func filterBySubstring(strings: [String], substring: String) -> [String] {
    return strings.filter { $0.contains(substring) }
}
```

func filterBySubstring(strings: [String], substring: String) -> [String] {
    return strings.filter { $0.contains(substring) }
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Filter an input array of strings only for ones that contain given substring
filterBySubstring(strings: [] as [String], substring: "a") == [] as [String]
filterBySubstring(strings: ["abc", "bacd", "cde", "array"], substring: "a") == ["abc", "bacd", "array"]
### Response:
```swift
func filterBySubstring(strings: [String], substring: String) -> [String] {
    return strings.filter { $0.contains(substring) }
}
```

func filterBySubstring(strings: [String], substring: String) -> [String] {
    return strings.filter { $0.contains(substring) }
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Filter an input array of strings only for ones that contain given substring
filterBySubstring(strings: [] as [String], substring: "a") == [] as [String]
filterBySubstring(strings: ["abc", "bacd", "cde", "array"], substring: "a") == ["abc", "bacd", "array"]
### Response:
```swift
func filterBySubstring(strings: [String], substring: String) -> [String] {
    return strings.filter { $0.contains(substring) }
}
```

func filterBySubstring(strings: [String], substring: String) -> [String] {
    return strings.filter { $0.contains(substring) }
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Filter an input array of strings only for ones that contain given substring
filterBySubstring(strings: [] as [String], substring: "a") == [] as [String]
filterBySubstring(strings: ["abc", "bacd", "cde", "array"], substring: "a") == ["abc", "bacd", "array"]
### Response:
```swift
func filterBySubstring(strings: [String], substring: String) -> [String] {
    return strings.filter { $0.contains(substring) }
}
```

func filterBySubstring(strings: [String], substring: String) -> [String] {
    return strings.filter { $0.contains(substring) }
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Filter an input array of strings only for ones that contain given substring
filterBySubstring(strings: [] as [String], substring: "a") == [] as [String]
filterBySubstring(strings: ["abc", "bacd", "cde", "array"], substring: "a") == ["abc", "bacd", "array"]
### Response:
```swift
func filterBySubstring(strings: [String], substring: String) -> [String] {
    return strings.filter { $0.contains(substring) }
}
```

func sumProduct(numbers: [Int]) -> (Int, Int) {
    var sum = 0
    var product = 1
    for number in numbers {
        sum += number
        product *= number
    }
    return (sum, product)
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
For a given array of integers, return a tuple consisting of a sum and a product of all the integers in an array.
Empty sum should be equal to 0 and empty product should be equal to 1.
sumProduct(numbers: [] as [Int]) == (0, 1)
sumProduct(numbers: [1, 2, 3, 4]) == (10, 24)
### Response:
```swift
func sumProduct(numbers: [Int]) -> (Int, Int) {
    var sum = 0
    var product = 1
    for number in numbers {
        sum += number
        product *= number
    }
    return (sum, product)
}
```

func sumProduct(numbers: [Int]) -> (Int, Int) {
    var sum = 0
    var product = 1
    for number in numbers {
        sum += number
        product *= number
    }
    return (sum, product)
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
For a given array of integers, return a tuple consisting of a sum and a product of all the integers in an array.
Empty sum should be equal to 0 and empty product should be equal to 1.
sumProduct(numbers: [] as [Int]) == (0, 1)
sumProduct(numbers: [1, 2, 3, 4]) == (10, 24)
### Response:
```swift
func sumProduct(numbers: [Int]) -> (Int, Int) {
    var sum = 0
    var product = 1
    for number in numbers {
        sum += number
        product *= number
    }
    return (sum, product)
}
```

func sumProduct(numbers: [Int]) -> (Int, Int) {
    var sum = 0
    var product = 1
    for number in numbers {
        sum += number
        product *= number
    }
    return (sum, product)
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
For a given array of integers, return a tuple consisting of a sum and a product of all the integers in an array.
Empty sum should be equal to 0 and empty product should be equal to 1.
sumProduct(numbers: [] as [Int]) == (0, 1)
sumProduct(numbers: [1, 2, 3, 4]) == (10, 24)
### Response:
```swift
func sumProduct(numbers: [Int]) -> (Int, Int) {
    var sum = 0
    var product = 1
    for number in numbers {
        sum += number
        product *= number
    }
    return (sum, product)
}
```

func sumProduct(numbers: [Int]) -> (Int, Int) {
    var sum = 0
    var product = 1
    for number in numbers {
        sum += number
        product *= number
    }
    return (sum, product)
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
For a given array of integers, return a tuple consisting of a sum and a product of all the integers in an array.
Empty sum should be equal to 0 and empty product should be equal to 1.
sumProduct(numbers: [] as [Int]) == (0, 1)
sumProduct(numbers: [1, 2, 3, 4]) == (10, 24)
### Response:
```swift
func sumProduct(numbers: [Int]) -> (Int, Int) {
    var sum = 0
    var product = 1
    for number in numbers {
        sum += number
        product *= number
    }
    return (sum, product)
}
```

func sumProduct(numbers: [Int]) -> (Int, Int) {
    var sum = 0
    var product = 1
    for number in numbers {
        sum += number
        product *= number
    }
    return (sum, product)
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
For a given array of integers, return a tuple consisting of a sum and a product of all the integers in an array.
Empty sum should be equal to 0 and empty product should be equal to 1.
sumProduct(numbers: [] as [Int]) == (0, 1)
sumProduct(numbers: [1, 2, 3, 4]) == (10, 24)
### Response:
```swift
func sumProduct(numbers: [Int]) -> (Int, Int) {
    var sum = 0
    var product = 1
    for number in numbers {
        sum += number
        product *= number
    }
    return (sum, product)
}
```

func sumProduct(numbers: [Int]) -> (Int, Int) {
    var sum = 0
    var product = 1
    for number in numbers {
        sum += number
        product *= number
    }
    return (sum, product)
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
For a given array of integers, return a tuple consisting of a sum and a product of all the integers in an array.
Empty sum should be equal to 0 and empty product should be equal to 1.
sumProduct(numbers: [] as [Int]) == (0, 1)
sumProduct(numbers: [1, 2, 3, 4]) == (10, 24)
### Response:
```swift
func sumProduct(numbers: [Int]) -> (Int, Int) {
    var sum = 0
    var product = 1
    for number in numbers {
        sum += number
        product *= number
    }
    return (sum, product)
}
```

func sumProduct(numbers: [Int]) -> (Int, Int) {
    var sum = 0
    var product = 1
    for number in numbers {
        sum += number
        product *= number
    }
    return (sum, product)
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
For a given array of integers, return a tuple consisting of a sum and a product of all the integers in an array.
Empty sum should be equal to 0 and empty product should be equal to 1.
sumProduct(numbers: [] as [Int]) == (0, 1)
sumProduct(numbers: [1, 2, 3, 4]) == (10, 24)
### Response:
```swift
func sumProduct(numbers: [Int]) -> (Int, Int) {
    var sum = 0
    var product = 1
    for number in numbers {
        sum += number
        product *= number
    }
    return (sum, product)
}
```

func sumProduct(numbers: [Int]) -> (Int, Int) {
    var sum = 0
    var product = 1
    for number in numbers {
        sum += number
        product *= number
    }
    return (sum, product)
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
For a given array of integers, return a tuple consisting of a sum and a product of all the integers in an array.
Empty sum should be equal to 0 and empty product should be equal to 1.
sumProduct(numbers: [] as [Int]) == (0, 1)
sumProduct(numbers: [1, 2, 3, 4]) == (10, 24)
### Response:
```swift
func sumProduct(numbers: [Int]) -> (Int, Int) {
    var sum = 0
    var product = 1
    for number in numbers {
        sum += number
        product *= number
    }
    return (sum, product)
}
```

func sumProduct(numbers: [Int]) -> (Int, Int) {
    var sum = 0
    var product = 1
    for number in numbers {
        sum += number
        product *= number
    }
    return (sum, product)
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
For a given array of integers, return a tuple consisting of a sum and a product of all the integers in an array.
Empty sum should be equal to 0 and empty product should be equal to 1.
sumProduct(numbers: [] as [Int]) == (0, 1)
sumProduct(numbers: [1, 2, 3, 4]) == (10, 24)
### Response:
```swift
func sumProduct(numbers: [Int]) -> (Int, Int) {
    var sum = 0
    var product = 1
    for number in numbers {
        sum += number
        product *= number
    }
    return (sum, product)
}
```

func sumProduct(numbers: [Int]) -> (Int, Int) {
    var sum = 0
    var product = 1
    for number in numbers {
        sum += number
        product *= number
    }
    return (sum, product)
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
For a given array of integers, return a tuple consisting of a sum and a product of all the integers in an array.
Empty sum should be equal to 0 and empty product should be equal to 1.
sumProduct(numbers: [] as [Int]) == (0, 1)
sumProduct(numbers: [1, 2, 3, 4]) == (10, 24)
### Response:
```swift
func sumProduct(numbers: [Int]) -> (Int, Int) {
    var sum = 0
    var product = 1
    for number in numbers {
        sum += number
        product *= number
    }
    return (sum, product)
}
```

func rollingMax(numbers: [Int]) -> [Int] {
    var result = [Int]()
    var max = numbers[0]
    for number in numbers {
        if number > max {
            max = number
        }
        result.append(max)
    }
    return result
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
From a given array of integers, generate an array of rolling maximum element found until given moment
in the sequence.
rollingMax(numbers: [1, 2, 3, 2, 3, 4, 2]) == [1, 2, 3, 3, 3, 4, 4]
### Response:
```swift
func rollingMax(numbers: [Int]) -> [Int] {
    var result = [Int]()
    var max = numbers[0]
    for number in numbers {
        if number > max {
            max = number
        }
        result.append(max)
    }
    return result
}
```

func rollingMax(numbers: [Int]) -> [Int] {
    var result = [Int]()
    var max = numbers[0]
    for i in 0..<numbers.count {
        if numbers[i] > max {
            max = numbers[i]
        }
        result.append(max)
    }
    return result
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
From a given array of integers, generate an array of rolling maximum element found until given moment
in the sequence.
rollingMax(numbers: [1, 2, 3, 2, 3, 4, 2]) == [1, 2, 3, 3, 3, 4, 4]
### Response:
```swift
func rollingMax(numbers: [Int]) -> [Int] {
    var result = [Int]()
    var max = numbers[0]
    for i in 0..<numbers.count {
        if numbers[i] > max {
            max = numbers[i]
        }
        result.append(max)
    }
    return result
}
```

func rollingMax(numbers: [Int]) -> [Int] {
    var result = [Int]()
    var max = numbers[0]
    for i in 1..<numbers.count {
        if numbers[i] > max {
            max = numbers[i]
        }
        result.append(max)
    }
    return result
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
From a given array of integers, generate an array of rolling maximum element found until given moment
in the sequence.
rollingMax(numbers: [1, 2, 3, 2, 3, 4, 2]) == [1, 2, 3, 3, 3, 4, 4]
### Response:
```swift
func rollingMax(numbers: [Int]) -> [Int] {
    var result = [Int]()
    var max = numbers[0]
    for i in 1..<numbers.count {
        if numbers[i] > max {
            max = numbers[i]
        }
        result.append(max)
    }
    return result
}
```

func rollingMax(numbers: [Int]) -> [Int] {
    var result = [Int]()
    var max = numbers[0]
    for i in 1..<numbers.count {
        if numbers[i] > max {
            max = numbers[i]
        }
        result.append(max)
    }
    return result
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
From a given array of integers, generate an array of rolling maximum element found until given moment
in the sequence.
rollingMax(numbers: [1, 2, 3, 2, 3, 4, 2]) == [1, 2, 3, 3, 3, 4, 4]
### Response:
```swift
func rollingMax(numbers: [Int]) -> [Int] {
    var result = [Int]()
    var max = numbers[0]
    for i in 1..<numbers.count {
        if numbers[i] > max {
            max = numbers[i]
        }
        result.append(max)
    }
    return result
}
```

func rollingMax(numbers: [Int]) -> [Int] {
    var result = [Int]()
    var max = numbers[0]
    for i in 0..<numbers.count {
        if max < numbers[i] {
            max = numbers[i]
        }
        result.append(max)
    }
    return result
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
From a given array of integers, generate an array of rolling maximum element found until given moment
in the sequence.
rollingMax(numbers: [1, 2, 3, 2, 3, 4, 2]) == [1, 2, 3, 3, 3, 4, 4]
### Response:
```swift
func rollingMax(numbers: [Int]) -> [Int] {
    var result = [Int]()
    var max = numbers[0]
    for i in 0..<numbers.count {
        if max < numbers[i] {
            max = numbers[i]
        }
        result.append(max)
    }
    return result
}
```

func rollingMax(numbers: [Int]) -> [Int] {
    var result: [Int] = []
    var max: Int = 0
    for number in numbers {
        if number > max {
            max = number
        }
        result.append(max)
    }
    return result
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
From a given array of integers, generate an array of rolling maximum element found until given moment
in the sequence.
rollingMax(numbers: [1, 2, 3, 2, 3, 4, 2]) == [1, 2, 3, 3, 3, 4, 4]
### Response:
```swift
func rollingMax(numbers: [Int]) -> [Int] {
    var result: [Int] = []
    var max: Int = 0
    for number in numbers {
        if number > max {
            max = number
        }
        result.append(max)
    }
    return result
}
```

func rollingMax(numbers: [Int]) -> [Int] {
    var result = [Int]()
    var max = numbers[0]
    for i in 0..<numbers.count {
        if numbers[i] > max {
            max = numbers[i]
        }
        result.append(max)
    }
    return result
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
From a given array of integers, generate an array of rolling maximum element found until given moment
in the sequence.
rollingMax(numbers: [1, 2, 3, 2, 3, 4, 2]) == [1, 2, 3, 3, 3, 4, 4]
### Response:
```swift
func rollingMax(numbers: [Int]) -> [Int] {
    var result = [Int]()
    var max = numbers[0]
    for i in 0..<numbers.count {
        if numbers[i] > max {
            max = numbers[i]
        }
        result.append(max)
    }
    return result
}
```

func rollingMax(numbers: [Int]) -> [Int] {
    var result = [Int]()
    var max = numbers[0]
    for i in 1..<numbers.count {
        if max < numbers[i] {
            max = numbers[i]
        }
        result.append(max)
    }
    return result
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
From a given array of integers, generate an array of rolling maximum element found until given moment
in the sequence.
rollingMax(numbers: [1, 2, 3, 2, 3, 4, 2]) == [1, 2, 3, 3, 3, 4, 4]
### Response:
```swift
func rollingMax(numbers: [Int]) -> [Int] {
    var result = [Int]()
    var max = numbers[0]
    for i in 1..<numbers.count {
        if max < numbers[i] {
            max = numbers[i]
        }
        result.append(max)
    }
    return result
}
```

func rollingMax(numbers: [Int]) -> [Int] {
    var result = [Int]()
    var max = numbers[0]
    for i in 1..<numbers.count {
        if numbers[i] > max {
            max = numbers[i]
        }
        result.append(max)
    }
    return result
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
From a given array of integers, generate an array of rolling maximum element found until given moment
in the sequence.
rollingMax(numbers: [1, 2, 3, 2, 3, 4, 2]) == [1, 2, 3, 3, 3, 4, 4]
### Response:
```swift
func rollingMax(numbers: [Int]) -> [Int] {
    var result = [Int]()
    var max = numbers[0]
    for i in 1..<numbers.count {
        if numbers[i] > max {
            max = numbers[i]
        }
        result.append(max)
    }
    return result
}
```

func rollingMax(numbers: [Int]) -> [Int] {
    var result = [Int]()
    var max = numbers[0]
    for i in 0..<numbers.count {
        if numbers[i] > max {
            max = numbers[i]
        }
        result.append(max)
    }
    return result
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
From a given array of integers, generate an array of rolling maximum element found until given moment
in the sequence.
rollingMax(numbers: [1, 2, 3, 2, 3, 4, 2]) == [1, 2, 3, 3, 3, 4, 4]
### Response:
```swift
func rollingMax(numbers: [Int]) -> [Int] {
    var result = [Int]()
    var max = numbers[0]
    for i in 0..<numbers.count {
        if numbers[i] > max {
            max = numbers[i]
        }
        result.append(max)
    }
    return result
}
```

func makePalindrome(string: String) -> String {
    let reversedString = string.reversed().map(String.init)
    let longestPalindrome = String(string.prefix(while: { reversedString.contains($0) }))
    return string + String(longestPalindrome.reversed())
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Find the shortest palindrome that begins with a supplied string.
Algorithm idea is simple:
- Find the longest postfix of supplied string that is a palindrome.
- Append to the end of the string reverse of a string prefix that comes before the palindromic suffix.
makePalindrome(string: "") == ""
makePalindrome(string: "cat") == "catac"
makePalindrome(string: "cata") == "catac"
### Response:
```swift
func makePalindrome(string: String) -> String {
    let reversedString = string.reversed().map(String.init)
    let longestPalindrome = String(string.prefix(while: { reversedString.contains($0) }))
    return string + String(longestPalindrome.reversed())
}
```

func makePalindrome(string: String) -> String {
    var palindrome = string
    var palindromicSuffix = ""
    var palindromicPrefix = ""
    
    for i in stride(from: palindrome.count - 1, through: 0, by: -1) {
        let suffix = palindrome.suffix(i + 1)
        if isPalindrome(string: suffix) {
            palindromicSuffix = suffix
            break
        }
    }
    
    for i in stride(from: palindrome.count - 1, through: 0, by: -1) {
        let prefix = palindrome.prefix(i + 1)
        if isPalindrome(string: prefix) {
            palindromicPrefix = String(prefix.reversed())
            break
        }
    }
    
    return palindrome + palindromicPrefix
}

func isPalindrome(string: String) -> Bool {
    return string == String(string.reversed())
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Find the shortest palindrome that begins with a supplied string.
Algorithm idea is simple:
- Find the longest postfix of supplied string that is a palindrome.
- Append to the end of the string reverse of a string prefix that comes before the palindromic suffix.
makePalindrome(string: "") == ""
makePalindrome(string: "cat") == "catac"
makePalindrome(string: "cata") == "catac"
### Response:
```swift
func makePalindrome(string: String) -> String {
    var palindrome = string
    var palindromicSuffix = ""
    var palindromicPrefix = ""
    
    for i in stride(from: palindrome.count - 1, through: 0, by: -1) {
        let suffix = palindrome.suffix(i + 1)
        if isPalindrome(string: suffix) {
            palindromicSuffix = suffix
            break
        }
    }
    
    for i in stride(from: palindrome.count - 1, through: 0, by: -1) {
        let prefix = palindrome.prefix(i + 1)
        if isPalindrome(string: prefix) {
            palindromicPrefix = String(prefix.reversed())
            break
        }
    }
    
    return palindrome + palindromicPrefix
}

func isPalindrome(string: String) -> Bool {
    return string == String(string.reversed())
}
```

func makePalindrome(string: String) -> String {
    let reversedString = String(string.reversed())
    return string + String(reversedString.prefix(string.count - 1))
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Find the shortest palindrome that begins with a supplied string.
Algorithm idea is simple:
- Find the longest postfix of supplied string that is a palindrome.
- Append to the end of the string reverse of a string prefix that comes before the palindromic suffix.
makePalindrome(string: "") == ""
makePalindrome(string: "cat") == "catac"
makePalindrome(string: "cata") == "catac"
### Response:
```swift
func makePalindrome(string: String) -> String {
    let reversedString = String(string.reversed())
    return string + String(reversedString.prefix(string.count - 1))
}
```

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Find the shortest palindrome that begins with a supplied string.
Algorithm idea is simple:
- Find the longest postfix of supplied string that is a palindrome.
- Append to the end of the string reverse of a string prefix that comes before the palindromic suffix.
makePalindrome(string: "") == ""
makePalindrome(string: "cat") == "catac"
makePalindrome(string: "cata") == "catac"
### Response:
```swift
func makePalindrome(string: String) -> String {
    let reversedString = String(string.reversed())
    let reversedStringWithoutPrefix = String(reversedString.dropFirst())
    let reversedStringWithoutPrefixAndSuffix = String(reversedStringWithoutPrefix.dropLast())
    let reversedStringWithoutPrefixAndSuffixAndSuffix = String(reversedStringWithoutPrefixAndSuffix.dropLast())
    let reversedStringWithoutPrefixAndSuffixAndSuffixAndPrefix = String(reversedStringWithoutPrefixAndSuffixAndSuffix.dropFirst())
    let reversedStringWithoutPrefixAndSuffixAndSuffixAndPrefixAndSuffix = String(reversedStringWithoutPrefixAndSuffixAndSuffixAndPrefix.dropLast())
    let reversedStringWithoutPrefixAndSuffixAndSuffixAndPrefixAndSuffixAndSuffix = String(reversedStringWithoutPrefixAndSuffixAndSuffixAndPrefixAndSuffix.dropLast())
    let reversedStringWithoutPrefixAndSuffixAndSuffixAndPrefixAndSuffixAndSuffixAndPrefix = String(reversedStringWithoutPrefixAndSuffixAndSuffixAndPrefixAndSuffixAndSuffix.dropFirst())
    let reversedStringWithoutPrefixAndSuffixAndSuffixAndPrefixAndSuffixAndSuffixAndPrefixAndSuffix = String(reversedStringWithoutPrefixAndSuffixAndSuffixAndPrefixAndSuffixAndSuffixAndPrefix.dropLast())
    let reversedStringWithoutPrefixAndSuffixAndSuffixAndPrefixAndSuffixAndSuffixAndPrefixAndSuffixAndSuffix = String(reversedStringWithoutPrefixAndSuffixAndSuffixAndPrefixAndSuffixAndSuffixAndPrefixAndSuffix.dropLast())
    let reversedStringWithoutPrefixAndSuffixAndSuffixAndPrefixAndSuffixAndSuffixAndPrefixAndSuffixAndSuffixAndPrefix = String(reversedStringWithoutPrefixAndSuffixAndSuffixAndPrefixAndSuffixAndSuffixAndPrefixAndSuffixAndSuffix.dropFirst())
    let reversedStringWithoutPrefixAndSuffixAndSuffixAndPrefixAndSuffixAndSuffixAndPrefixAndSuffixAndSuffixAndPrefixAndSuffix = String(reversedStringWithoutPrefixAndSuffixAndSuffixAndPrefixAndSuffixAndSuffixAndPrefixAndSuffixAndSuffix.dropLast())
    let reversedStringWithoutPrefixAndSuffixAndSuffixAndPrefixAndSuffixAndSuffixAndPrefixAndSuffixAndSuffixAndPrefixAndSuffixAndSuffix = String(reversedStringWithoutPrefixAndSuffixAndSuffixAndPrefixAndSuffixAndSuffixAndPrefixAndSuffixAndSuffixAndPrefixAndSuffix.dropLast())
    let reversedStringWithoutPrefixAndSuffixAndSuffixAndPrefixAndSuffixAndSuffixAndPrefixAndSuffixAndSuffixAndPrefixAndSuffixAndSuffixAndPrefix = String(reversedStringWithoutPrefixAndSuffixAndSuffixAndPrefixAndSuffixAndSuffixAndPrefixAndSuffixAndSuffixAndPrefixAndSuffixAndSuffix.dropFirst())
    let reversedStringWithoutPrefixAndSuffixAndSuffixAndPrefixAndSuffixAndSuffixAndPrefixAndSuffixAndSuffixAndPrefixAndSuffixAndSuffixAndPrefixAndSuffix = String(reversedStringWithoutPrefixAndSuffixAndSuffixAndPrefixAndSuffixAndSuffixAndPrefixAndSuffixAndSuffixAndPrefixAndSuffixAndSuffixAndPrefix.dropLast())
    let reversedStringWithoutPrefixAndSuffixAndSuffixAndPrefixAndSuffixAndSuffixAndPrefixAndSuffixAndSuffixAndPrefixAndSuffixAndSuffixAndPrefixAndSuffixAndSuffix = String(reversedStringWithoutPrefixAndSuffixAndSuffixAndPrefixAndSuffixAndSuffixAndPrefixAndSuffixAndSuffixAndPrefixAndSuffixAndSuffixAndPrefixAndSuffix.

func makePalindrome(string: String) -> String {
    var string = string
    var palindrome = ""
    while string.count > 0 {
        let last = string.last!
        if string.hasPrefix(String(last)) {
            palindrome = String(last) + palindrome + String(last)
            string.removeLast()
        } else {
            string.removeLast()
        }
    }
    return palindrome
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Find the shortest palindrome that begins with a supplied string.
Algorithm idea is simple:
- Find the longest postfix of supplied string that is a palindrome.
- Append to the end of the string reverse of a string prefix that comes before the palindromic suffix.
makePalindrome(string: "") == ""
makePalindrome(string: "cat") == "catac"
makePalindrome(string: "cata") == "catac"
### Response:
```swift
func makePalindrome(string: String) -> String {
    var string = string
    var palindrome = ""
    while string.count > 0 {
        let last = string.last!
        if string.hasPrefix(String(last)) {
            palindrome = String(last) + palindrome + String(last)
            string.removeLast()
        } else {
            string.removeLast()
        }
    }
    return palindrome
}
```

func makePalindrome(string: String) -> String {
    var string = string
    var longestPalindromeSuffix = ""
    var longestPalindromePrefix = ""
    var longestPalindrome = ""
    
    for i in stride(from: string.count - 1, through: 0, by: -1) {
        let suffix = string.suffix(from: i)
        let prefix = string.prefix(upTo: i)
        if isPalindrome(string: String(suffix)) {
            longestPalindromeSuffix = String(suffix)
            longestPalindromePrefix = String(prefix)
        }
    }
    
    if longestPalindromeSuffix.count > 0 {
        longestPalindrome = longestPalindromePrefix + longestPalindromeSuffix.reversed()
    }
    
    return longestPalindrome
}

func isPalindrome(string: String) -> Bool {
    return string == string.reversed()
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Find the shortest palindrome that begins with a supplied string.
Algorithm idea is simple:
- Find the longest postfix of supplied string that is a palindrome.
- Append to the end of the string reverse of a string prefix that comes before the palindromic suffix.
makePalindrome(string: "") == ""
makePalindrome(string: "cat") == "catac"
makePalindrome(string: "cata") == "catac"
### Response:
```swift
func makePalindrome(string: String) -> String {
    var string = string
    var longestPalindromeSuffix = ""
    var longestPalindromePrefix = ""
    var longestPalindrome = ""
    
    for i in stride(from: string.count - 1, through: 0, by: -1) {
        let suffix = string.suffix(from: i)
        let prefix = string.prefix(upTo: i)
        if isPalindrome(string: String(suffix)) {
            longestPalindromeSuffix = String(suffix)
            longestPalindromePrefix = String(prefix)
        }
    }
    
    if longestPalindromeSuffix.count > 0 {
        longestPalindrome = longestPalindromePrefix + longestPalindromeSuffix.reversed()
    }
    
    return longestPalindrome
}

func isPalindrome(string: String) -> Bool {
    return string == string.reversed()
}
```

func makePalindrome(string: String) -> String {
    let reversedString = string.reversed().map(String.init)
    let reversedStringPrefix = reversedString.prefix(while: { $0 == $1 })
    let reversedStringSuffix = reversedString.dropFirst(reversedStringPrefix.count)
    let reversedStringPrefixReversed = reversedStringPrefix.reversed()
    return string + String(reversedStringPrefixReversed) + String(reversedStringSuffix)
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Find the shortest palindrome that begins with a supplied string.
Algorithm idea is simple:
- Find the longest postfix of supplied string that is a palindrome.
- Append to the end of the string reverse of a string prefix that comes before the palindromic suffix.
makePalindrome(string: "") == ""
makePalindrome(string: "cat") == "catac"
makePalindrome(string: "cata") == "catac"
### Response:
```swift
func makePalindrome(string: String) -> String {
    let reversedString = string.reversed().map(String.init)
    let reversedStringPrefix = reversedString.prefix(while: { $0 == $1 })
    let reversedStringSuffix = reversedString.dropFirst(reversedStringPrefix.count)
    let reversedStringPrefixReversed = reversedStringPrefix.reversed()
    return string + String(reversedStringPrefixReversed) + String(reversedStringSuffix)
}
```

func makePalindrome(string: String) -> String {
    let reversedString = String(string.reversed())
    let longestPalindromeSuffix = string.prefix { reversedString.contains($0) } ?? ""
    return string + String(longestPalindromeSuffix.reversed())
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Find the shortest palindrome that begins with a supplied string.
Algorithm idea is simple:
- Find the longest postfix of supplied string that is a palindrome.
- Append to the end of the string reverse of a string prefix that comes before the palindromic suffix.
makePalindrome(string: "") == ""
makePalindrome(string: "cat") == "catac"
makePalindrome(string: "cata") == "catac"
### Response:
```swift
func makePalindrome(string: String) -> String {
    let reversedString = String(string.reversed())
    let longestPalindromeSuffix = string.prefix { reversedString.contains($0) } ?? ""
    return string + String(longestPalindromeSuffix.reversed())
}
```

func makePalindrome(string: String) -> String {
    var result = string
    var i = string.count - 1
    while i >= 0 {
        if string.prefix(i + 1) == String(string.prefix(i + 1).reversed()) {
            result.append(contentsOf: String(string.prefix(i + 1).reversed()))
            break
        }
        i -= 1
    }
    return result
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Find the shortest palindrome that begins with a supplied string.
Algorithm idea is simple:
- Find the longest postfix of supplied string that is a palindrome.
- Append to the end of the string reverse of a string prefix that comes before the palindromic suffix.
makePalindrome(string: "") == ""
makePalindrome(string: "cat") == "catac"
makePalindrome(string: "cata") == "catac"
### Response:
```swift
func makePalindrome(string: String) -> String {
    var result = string
    var i = string.count - 1
    while i >= 0 {
        if string.prefix(i + 1) == String(string.prefix(i + 1).reversed()) {
            result.append(contentsOf: String(string.prefix(i + 1).reversed()))
            break
        }
        i -= 1
    }
    return result
}
```

func makePalindrome(string: String) -> String {
    let reversedString = String(string.reversed())
    return string + String(reversedString.prefix(string.count))
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Find the shortest palindrome that begins with a supplied string.
Algorithm idea is simple:
- Find the longest postfix of supplied string that is a palindrome.
- Append to the end of the string reverse of a string prefix that comes before the palindromic suffix.
makePalindrome(string: "") == ""
makePalindrome(string: "cat") == "catac"
makePalindrome(string: "cata") == "catac"
### Response:
```swift
func makePalindrome(string: String) -> String {
    let reversedString = String(string.reversed())
    return string + String(reversedString.prefix(string.count))
}
```

func stringXor(a: String, b: String) -> String {
    var result = ""
    for (index, element) in a.enumerated() {
        if b[index] == element {
            result.append("0")
        } else {
            result.append("1")
        }
    }
    return result
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Input are two strings a and b consisting only of 1s and 0s.
Perform binary XOR on these inputs and return result also as a string.
stringXor(a: "010", b: "110") == "100"
### Response:
```swift
func stringXor(a: String, b: String) -> String {
    var result = ""
    for (index, element) in a.enumerated() {
        if b[index] == element {
            result.append("0")
        } else {
            result.append("1")
        }
    }
    return result
}
```

func stringXor(a: String, b: String) -> String {
    let a = Array(a)
    let b = Array(b)
    var result = ""
    for i in 0..<a.count {
        if a[i] == b[i] {
            result.append("0")
        } else {
            result.append("1")
        }
    }
    return result
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Input are two strings a and b consisting only of 1s and 0s.
Perform binary XOR on these inputs and return result also as a string.
stringXor(a: "010", b: "110") == "100"
### Response:
```swift
func stringXor(a: String, b: String) -> String {
    let a = Array(a)
    let b = Array(b)
    var result = ""
    for i in 0..<a.count {
        if a[i] == b[i] {
            result.append("0")
        } else {
            result.append("1")
        }
    }
    return result
}
```

func stringXor(a: String, b: String) -> String {
    var result = ""
    for (index, element) in a.enumerated() {
        if element == b[index] {
            result.append("0")
        } else {
            result.append("1")
        }
    }
    return result
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Input are two strings a and b consisting only of 1s and 0s.
Perform binary XOR on these inputs and return result also as a string.
stringXor(a: "010", b: "110") == "100"
### Response:
```swift
func stringXor(a: String, b: String) -> String {
    var result = ""
    for (index, element) in a.enumerated() {
        if element == b[index] {
            result.append("0")
        } else {
            result.append("1")
        }
    }
    return result
}
```

func stringXor(a: String, b: String) -> String {
    let a = Array(a)
    let b = Array(b)
    var result = ""
    for i in 0..<a.count {
        if a[i] == b[i] {
            result += "0"
        } else {
            result += "1"
        }
    }
    return result
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Input are two strings a and b consisting only of 1s and 0s.
Perform binary XOR on these inputs and return result also as a string.
stringXor(a: "010", b: "110") == "100"
### Response:
```swift
func stringXor(a: String, b: String) -> String {
    let a = Array(a)
    let b = Array(b)
    var result = ""
    for i in 0..<a.count {
        if a[i] == b[i] {
            result += "0"
        } else {
            result += "1"
        }
    }
    return result
}
```

func stringXor(a: String, b: String) -> String {
    var result = ""
    for i in 0..<a.count {
        let aChar = a[a.index(a.startIndex, offsetBy: i)]
        let bChar = b[b.index(b.startIndex, offsetBy: i)]
        if aChar == bChar {
            result += "0"
        } else {
            result += "1"
        }
    }
    return result
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Input are two strings a and b consisting only of 1s and 0s.
Perform binary XOR on these inputs and return result also as a string.
stringXor(a: "010", b: "110") == "100"
### Response:
```swift
func stringXor(a: String, b: String) -> String {
    var result = ""
    for i in 0..<a.count {
        let aChar = a[a.index(a.startIndex, offsetBy: i)]
        let bChar = b[b.index(b.startIndex, offsetBy: i)]
        if aChar == bChar {
            result += "0"
        } else {
            result += "1"
        }
    }
    return result
}
```

func stringXor(a: String, b: String) -> String {
    let a = Array(a)
    let b = Array(b)
    var result = ""
    for i in 0..<a.count {
        if a[i] == b[i] {
            result += "0"
        } else {
            result += "1"
        }
    }
    return result
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Input are two strings a and b consisting only of 1s and 0s.
Perform binary XOR on these inputs and return result also as a string.
stringXor(a: "010", b: "110") == "100"
### Response:
```swift
func stringXor(a: String, b: String) -> String {
    let a = Array(a)
    let b = Array(b)
    var result = ""
    for i in 0..<a.count {
        if a[i] == b[i] {
            result += "0"
        } else {
            result += "1"
        }
    }
    return result
}
```

func stringXor(a: String, b: String) -> String {
    let a = Array(a)
    let b = Array(b)
    var result = ""
    for i in 0..<a.count {
        if a[i] == b[i] {
            result.append("0")
        } else {
            result.append("1")
        }
    }
    return result
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Input are two strings a and b consisting only of 1s and 0s.
Perform binary XOR on these inputs and return result also as a string.
stringXor(a: "010", b: "110") == "100"
### Response:
```swift
func stringXor(a: String, b: String) -> String {
    let a = Array(a)
    let b = Array(b)
    var result = ""
    for i in 0..<a.count {
        if a[i] == b[i] {
            result.append("0")
        } else {
            result.append("1")
        }
    }
    return result
}
```

func stringXor(a: String, b: String) -> String {
    let a = Array(a)
    let b = Array(b)
    var result = ""
    for i in 0..<a.count {
        if a[i] == b[i] {
            result += "0"
        } else {
            result += "1"
        }
    }
    return result
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Input are two strings a and b consisting only of 1s and 0s.
Perform binary XOR on these inputs and return result also as a string.
stringXor(a: "010", b: "110") == "100"
### Response:
```swift
func stringXor(a: String, b: String) -> String {
    let a = Array(a)
    let b = Array(b)
    var result = ""
    for i in 0..<a.count {
        if a[i] == b[i] {
            result += "0"
        } else {
            result += "1"
        }
    }
    return result
}
```

func stringXor(a: String, b: String) -> String {
    let a = Array(a)
    let b = Array(b)
    var result = ""
    for i in 0..<a.count {
        if a[i] == b[i] {
            result.append("0")
        } else {
            result.append("1")
        }
    }
    return result
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Input are two strings a and b consisting only of 1s and 0s.
Perform binary XOR on these inputs and return result also as a string.
stringXor(a: "010", b: "110") == "100"
### Response:
```swift
func stringXor(a: String, b: String) -> String {
    let a = Array(a)
    let b = Array(b)
    var result = ""
    for i in 0..<a.count {
        if a[i] == b[i] {
            result.append("0")
        } else {
            result.append("1")
        }
    }
    return result
}
```

func stringXor(a: String, b: String) -> String {
    let a = a.map { $0 == "1" ? true : false }
    let b = b.map { $0 == "1" ? true : false }
    let result = zip(a, b).map { $0.0 != $0.1 }
    return result.map { $0 ? "1" : "0" }.joined()
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Input are two strings a and b consisting only of 1s and 0s.
Perform binary XOR on these inputs and return result also as a string.
stringXor(a: "010", b: "110") == "100"
### Response:
```swift
func stringXor(a: String, b: String) -> String {
    let a = a.map { $0 == "1" ? true : false }
    let b = b.map { $0 == "1" ? true : false }
    let result = zip(a, b).map { $0.0 != $0.1 }
    return result.map { $0 ? "1" : "0" }.joined()
}
```

func longest(strings: [String]) -> String? {
    guard !strings.isEmpty else { return nil }
    return strings.reduce("", { max($0, $1) })
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Out of array of strings, return the longest one. Return the first one in case of multiple
strings of the same length. Return nil in case the input array is empty.
longest(strings: [] as [String]) == nil
longest(strings: ["a", "b", "c"]) == "a"
longest(strings: ["a", "bb", "ccc"]) == "ccc"
### Response:
```swift
func longest(strings: [String]) -> String? {
    guard !strings.isEmpty else { return nil }
    return strings.reduce("", { max($0, $1) })
}
```

func longest(strings: [String]) -> String? {
    return strings.max(by: { $0.count < $1.count })
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Out of array of strings, return the longest one. Return the first one in case of multiple
strings of the same length. Return nil in case the input array is empty.
longest(strings: [] as [String]) == nil
longest(strings: ["a", "b", "c"]) == "a"
longest(strings: ["a", "bb", "ccc"]) == "ccc"
### Response:
```swift
func longest(strings: [String]) -> String? {
    return strings.max(by: { $0.count < $1.count })
}
```

func longest(strings: [String]) -> String? {
    return strings.max { $0.count < $1.count }
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Out of array of strings, return the longest one. Return the first one in case of multiple
strings of the same length. Return nil in case the input array is empty.
longest(strings: [] as [String]) == nil
longest(strings: ["a", "b", "c"]) == "a"
longest(strings: ["a", "bb", "ccc"]) == "ccc"
### Response:
```swift
func longest(strings: [String]) -> String? {
    return strings.max { $0.count < $1.count }
}
```

func longest(strings: [String]) -> String? {
    guard !strings.isEmpty else { return nil }
    return strings.max(by: { $0.count < $1.count })
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Out of array of strings, return the longest one. Return the first one in case of multiple
strings of the same length. Return nil in case the input array is empty.
longest(strings: [] as [String]) == nil
longest(strings: ["a", "b", "c"]) == "a"
longest(strings: ["a", "bb", "ccc"]) == "ccc"
### Response:
```swift
func longest(strings: [String]) -> String? {
    guard !strings.isEmpty else { return nil }
    return strings.max(by: { $0.count < $1.count })
}
```

func longest(strings: [String]) -> String? {
    guard !strings.isEmpty else { return nil }
    return strings.max(by: { $0.count < $1.count })
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Out of array of strings, return the longest one. Return the first one in case of multiple
strings of the same length. Return nil in case the input array is empty.
longest(strings: [] as [String]) == nil
longest(strings: ["a", "b", "c"]) == "a"
longest(strings: ["a", "bb", "ccc"]) == "ccc"
### Response:
```swift
func longest(strings: [String]) -> String? {
    guard !strings.isEmpty else { return nil }
    return strings.max(by: { $0.count < $1.count })
}
```

func longest(strings: [String]) -> String? {
    guard !strings.isEmpty else { return nil }
    return strings.reduce("", { max($0, $1) })
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Out of array of strings, return the longest one. Return the first one in case of multiple
strings of the same length. Return nil in case the input array is empty.
longest(strings: [] as [String]) == nil
longest(strings: ["a", "b", "c"]) == "a"
longest(strings: ["a", "bb", "ccc"]) == "ccc"
### Response:
```swift
func longest(strings: [String]) -> String? {
    guard !strings.isEmpty else { return nil }
    return strings.reduce("", { max($0, $1) })
}
```

func longest(strings: [String]) -> String? {
    guard !strings.isEmpty else { return nil }
    return strings.max { $0.count < $1.count }
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Out of array of strings, return the longest one. Return the first one in case of multiple
strings of the same length. Return nil in case the input array is empty.
longest(strings: [] as [String]) == nil
longest(strings: ["a", "b", "c"]) == "a"
longest(strings: ["a", "bb", "ccc"]) == "ccc"
### Response:
```swift
func longest(strings: [String]) -> String? {
    guard !strings.isEmpty else { return nil }
    return strings.max { $0.count < $1.count }
}
```

func longest(strings: [String]) -> String? {
    return strings.max(by: { $0.count < $1.count })
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Out of array of strings, return the longest one. Return the first one in case of multiple
strings of the same length. Return nil in case the input array is empty.
longest(strings: [] as [String]) == nil
longest(strings: ["a", "b", "c"]) == "a"
longest(strings: ["a", "bb", "ccc"]) == "ccc"
### Response:
```swift
func longest(strings: [String]) -> String? {
    return strings.max(by: { $0.count < $1.count })
}
```

func longest(strings: [String]) -> String? {
    return strings.max(by: { $0.count < $1.count })
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Out of array of strings, return the longest one. Return the first one in case of multiple
strings of the same length. Return nil in case the input array is empty.
longest(strings: [] as [String]) == nil
longest(strings: ["a", "b", "c"]) == "a"
longest(strings: ["a", "bb", "ccc"]) == "ccc"
### Response:
```swift
func longest(strings: [String]) -> String? {
    return strings.max(by: { $0.count < $1.count })
}
```

func longest(strings: [String]) -> String? {
    guard !strings.isEmpty else { return nil }
    var longestString: String?
    var longestStringLength: Int = 0
    for string in strings {
        if string.count > longestStringLength {
            longestString = string
            longestStringLength = string.count
        }
    }
    return longestString
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Out of array of strings, return the longest one. Return the first one in case of multiple
strings of the same length. Return nil in case the input array is empty.
longest(strings: [] as [String]) == nil
longest(strings: ["a", "b", "c"]) == "a"
longest(strings: ["a", "bb", "ccc"]) == "ccc"
### Response:
```swift
func longest(strings: [String]) -> String? {
    guard !strings.isEmpty else { return nil }
    var longestString: String?
    var longestStringLength: Int = 0
    for string in strings {
        if string.count > longestStringLength {
            longestString = string
            longestStringLength = string.count
        }
    }
    return longestString
}
```

func greatestCommonDivisor(a: Int, b: Int) -> Int {
    var a = a
    var b = b
    while a != b {
        if a > b {
            a = a - b
        } else {
            b = b - a
        }
    }
    return a
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Return a greatest common divisor of two integers a and b
greatestCommonDivisor(a: 3, b: 5) == 1
greatestCommonDivisor(a: 25, b: 15) == 5
### Response:
```swift
func greatestCommonDivisor(a: Int, b: Int) -> Int {
    var a = a
    var b = b
    while a != b {
        if a > b {
            a = a - b
        } else {
            b = b - a
        }
    }
    return a
}
```

func greatestCommonDivisor(a: Int, b: Int) -> Int {
    var a = a
    var b = b
    while a != b {
        if a > b {
            a = a - b
        } else {
            b = b - a
        }
    }
    return a
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Return a greatest common divisor of two integers a and b
greatestCommonDivisor(a: 3, b: 5) == 1
greatestCommonDivisor(a: 25, b: 15) == 5
### Response:
```swift
func greatestCommonDivisor(a: Int, b: Int) -> Int {
    var a = a
    var b = b
    while a != b {
        if a > b {
            a = a - b
        } else {
            b = b - a
        }
    }
    return a
}
```

func greatestCommonDivisor(a: Int, b: Int) -> Int {
    return b == 0 ? a : greatestCommonDivisor(a: b, b: a % b)
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Return a greatest common divisor of two integers a and b
greatestCommonDivisor(a: 3, b: 5) == 1
greatestCommonDivisor(a: 25, b: 15) == 5
### Response:
```swift
func greatestCommonDivisor(a: Int, b: Int) -> Int {
    return b == 0 ? a : greatestCommonDivisor(a: b, b: a % b)
}
```

func greatestCommonDivisor(a: Int, b: Int) -> Int {
    if a == 0 || b == 0 {
        return 0
    }
    if a == b {
        return a
    }
    return greatestCommonDivisor(a: min(a, b), b: abs(a - b))
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Return a greatest common divisor of two integers a and b
greatestCommonDivisor(a: 3, b: 5) == 1
greatestCommonDivisor(a: 25, b: 15) == 5
### Response:
```swift
func greatestCommonDivisor(a: Int, b: Int) -> Int {
    if a == 0 || b == 0 {
        return 0
    }
    if a == b {
        return a
    }
    return greatestCommonDivisor(a: min(a, b), b: abs(a - b))
}
```

func greatestCommonDivisor(a: Int, b: Int) -> Int {
    var a = a
    var b = b
    while a != b {
        if a > b {
            a = a - b
        } else {
            b = b - a
        }
    }
    return a
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Return a greatest common divisor of two integers a and b
greatestCommonDivisor(a: 3, b: 5) == 1
greatestCommonDivisor(a: 25, b: 15) == 5
### Response:
```swift
func greatestCommonDivisor(a: Int, b: Int) -> Int {
    var a = a
    var b = b
    while a != b {
        if a > b {
            a = a - b
        } else {
            b = b - a
        }
    }
    return a
}
```

func greatestCommonDivisor(a: Int, b: Int) -> Int {
    return b == 0 ? a : greatestCommonDivisor(a: b, b: a % b)
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Return a greatest common divisor of two integers a and b
greatestCommonDivisor(a: 3, b: 5) == 1
greatestCommonDivisor(a: 25, b: 15) == 5
### Response:
```swift
func greatestCommonDivisor(a: Int, b: Int) -> Int {
    return b == 0 ? a : greatestCommonDivisor(a: b, b: a % b)
}
```

func greatestCommonDivisor(a: Int, b: Int) -> Int {
    return b == 0 ? a : greatestCommonDivisor(a: b, b: a % b)
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Return a greatest common divisor of two integers a and b
greatestCommonDivisor(a: 3, b: 5) == 1
greatestCommonDivisor(a: 25, b: 15) == 5
### Response:
```swift
func greatestCommonDivisor(a: Int, b: Int) -> Int {
    return b == 0 ? a : greatestCommonDivisor(a: b, b: a % b)
}
```

func greatestCommonDivisor(a: Int, b: Int) -> Int {
    return b == 0 ? a : greatestCommonDivisor(a: b, b: a % b)
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Return a greatest common divisor of two integers a and b
greatestCommonDivisor(a: 3, b: 5) == 1
greatestCommonDivisor(a: 25, b: 15) == 5
### Response:
```swift
func greatestCommonDivisor(a: Int, b: Int) -> Int {
    return b == 0 ? a : greatestCommonDivisor(a: b, b: a % b)
}
```

func greatestCommonDivisor(a: Int, b: Int) -> Int {
    return b == 0 ? a : greatestCommonDivisor(a: b, b: a % b)
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Return a greatest common divisor of two integers a and b
greatestCommonDivisor(a: 3, b: 5) == 1
greatestCommonDivisor(a: 25, b: 15) == 5
### Response:
```swift
func greatestCommonDivisor(a: Int, b: Int) -> Int {
    return b == 0 ? a : greatestCommonDivisor(a: b, b: a % b)
}
```

func greatestCommonDivisor(a: Int, b: Int) -> Int {
    var a = a
    var b = b
    while a != b {
        if a > b {
            a = a - b
        } else {
            b = b - a
        }
    }
    return a
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Return a greatest common divisor of two integers a and b
greatestCommonDivisor(a: 3, b: 5) == 1
greatestCommonDivisor(a: 25, b: 15) == 5
### Response:
```swift
func greatestCommonDivisor(a: Int, b: Int) -> Int {
    var a = a
    var b = b
    while a != b {
        if a > b {
            a = a - b
        } else {
            b = b - a
        }
    }
    return a
}
```

func allPrefixes(string: String) -> [String] {
    return (0..<string.count).map { string.prefix(upTo: $0) }
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Return array of all prefixes from shortest to longest of the input string
allPrefixes(string: "abc") == ["a", "ab", "abc"]
### Response:
```swift
func allPrefixes(string: String) -> [String] {
    return (0..<string.count).map { string.prefix(upTo: $0) }
}
```

func allPrefixes(string: String) -> [String] {
    return (0..<string.count).map { string.prefix(upTo: $0) }
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Return array of all prefixes from shortest to longest of the input string
allPrefixes(string: "abc") == ["a", "ab", "abc"]
### Response:
```swift
func allPrefixes(string: String) -> [String] {
    return (0..<string.count).map { string.prefix(upTo: $0) }
}
```

func allPrefixes(string: String) -> [String] {
    var result: [String] = []
    for i in 0..<string.count {
        result.append(string.prefix(i + 1))
    }
    return result
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Return array of all prefixes from shortest to longest of the input string
allPrefixes(string: "abc") == ["a", "ab", "abc"]
### Response:
```swift
func allPrefixes(string: String) -> [String] {
    var result: [String] = []
    for i in 0..<string.count {
        result.append(string.prefix(i + 1))
    }
    return result
}
```

func allPrefixes(string: String) -> [String] {
    var result = [String]()
    for i in 0..<string.count {
        result.append(string.prefix(i + 1))
    }
    return result
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Return array of all prefixes from shortest to longest of the input string
allPrefixes(string: "abc") == ["a", "ab", "abc"]
### Response:
```swift
func allPrefixes(string: String) -> [String] {
    var result = [String]()
    for i in 0..<string.count {
        result.append(string.prefix(i + 1))
    }
    return result
}
```

func allPrefixes(string: String) -> [String] {
    return Array(string.prefix(while: { $0 != "" }))
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Return array of all prefixes from shortest to longest of the input string
allPrefixes(string: "abc") == ["a", "ab", "abc"]
### Response:
```swift
func allPrefixes(string: String) -> [String] {
    return Array(string.prefix(while: { $0 != "" }))
}
```

func allPrefixes(string: String) -> [String] {
    return (0..<string.count).map { string.prefix(upTo: $0) }
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Return array of all prefixes from shortest to longest of the input string
allPrefixes(string: "abc") == ["a", "ab", "abc"]
### Response:
```swift
func allPrefixes(string: String) -> [String] {
    return (0..<string.count).map { string.prefix(upTo: $0) }
}
```

func allPrefixes(string: String) -> [String] {
    var prefixes = [String]()
    for i in 0..<string.count {
        prefixes.append(String(string[string.startIndex..<string.index(string.startIndex, offsetBy: i + 1)]))
    }
    return prefixes
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Return array of all prefixes from shortest to longest of the input string
allPrefixes(string: "abc") == ["a", "ab", "abc"]
### Response:
```swift
func allPrefixes(string: String) -> [String] {
    var prefixes = [String]()
    for i in 0..<string.count {
        prefixes.append(String(string[string.startIndex..<string.index(string.startIndex, offsetBy: i + 1)]))
    }
    return prefixes
}
```

func allPrefixes(string: String) -> [String] {
    var result = [String]()
    for i in 0..<string.count {
        result.append(String(string.prefix(i + 1)))
    }
    return result
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Return array of all prefixes from shortest to longest of the input string
allPrefixes(string: "abc") == ["a", "ab", "abc"]
### Response:
```swift
func allPrefixes(string: String) -> [String] {
    var result = [String]()
    for i in 0..<string.count {
        result.append(String(string.prefix(i + 1)))
    }
    return result
}
```

func allPrefixes(string: String) -> [String] {
    var result = [String]()
    for i in 0..<string.count {
        result.append(string[string.index(string.startIndex, offsetBy: i)..<string.endIndex])
    }
    return result
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Return array of all prefixes from shortest to longest of the input string
allPrefixes(string: "abc") == ["a", "ab", "abc"]
### Response:
```swift
func allPrefixes(string: String) -> [String] {
    var result = [String]()
    for i in 0..<string.count {
        result.append(string[string.index(string.startIndex, offsetBy: i)..<string.endIndex])
    }
    return result
}
```

func allPrefixes(string: String) -> [String] {
    var result = [String]()
    for i in 0..<string.count {
        result.append(String(string[string.startIndex..<string.index(string.startIndex, offsetBy: i + 1)]))
    }
    return result
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Return array of all prefixes from shortest to longest of the input string
allPrefixes(string: "abc") == ["a", "ab", "abc"]
### Response:
```swift
func allPrefixes(string: String) -> [String] {
    var result = [String]()
    for i in 0..<string.count {
        result.append(String(string[string.startIndex..<string.index(string.startIndex, offsetBy: i + 1)]))
    }
    return result
}
```

func stringSequence(n: Int) -> String {
    return (0...n).map { String($0) }.joined(separator: " ")
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Return a string containing space-delimited numbers starting from 0 upto n inclusive.
stringSequence(n: 0) == "0"
stringSequence(n: 5) == "0 1 2 3 4 5"
### Response:
```swift
func stringSequence(n: Int) -> String {
    return (0...n).map { String($0) }.joined(separator: " ")
}
```

func stringSequence(n: Int) -> String {
    return (0...n).map { String($0) }.joined(separator: " ")
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Return a string containing space-delimited numbers starting from 0 upto n inclusive.
stringSequence(n: 0) == "0"
stringSequence(n: 5) == "0 1 2 3 4 5"
### Response:
```swift
func stringSequence(n: Int) -> String {
    return (0...n).map { String($0) }.joined(separator: " ")
}
```

func stringSequence(n: Int) -> String {
    return (0...n).map(String.init).joined(separator: " ")
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Return a string containing space-delimited numbers starting from 0 upto n inclusive.
stringSequence(n: 0) == "0"
stringSequence(n: 5) == "0 1 2 3 4 5"
### Response:
```swift
func stringSequence(n: Int) -> String {
    return (0...n).map(String.init).joined(separator: " ")
}
```

func stringSequence(n: Int) -> String {
    return (0...n).map { String($0) }.joined(separator: " ")
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Return a string containing space-delimited numbers starting from 0 upto n inclusive.
stringSequence(n: 0) == "0"
stringSequence(n: 5) == "0 1 2 3 4 5"
### Response:
```swift
func stringSequence(n: Int) -> String {
    return (0...n).map { String($0) }.joined(separator: " ")
}
```

func stringSequence(n: Int) -> String {
    return (0...n).map(String.init).joined(separator: " ")
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Return a string containing space-delimited numbers starting from 0 upto n inclusive.
stringSequence(n: 0) == "0"
stringSequence(n: 5) == "0 1 2 3 4 5"
### Response:
```swift
func stringSequence(n: Int) -> String {
    return (0...n).map(String.init).joined(separator: " ")
}
```

func stringSequence(n: Int) -> String {
    return (0...n).map(String.init).joined(separator: " ")
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Return a string containing space-delimited numbers starting from 0 upto n inclusive.
stringSequence(n: 0) == "0"
stringSequence(n: 5) == "0 1 2 3 4 5"
### Response:
```swift
func stringSequence(n: Int) -> String {
    return (0...n).map(String.init).joined(separator: " ")
}
```

func stringSequence(n: Int) -> String {
    return (0...n).map(String.init).joined(separator: " ")
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Return a string containing space-delimited numbers starting from 0 upto n inclusive.
stringSequence(n: 0) == "0"
stringSequence(n: 5) == "0 1 2 3 4 5"
### Response:
```swift
func stringSequence(n: Int) -> String {
    return (0...n).map(String.init).joined(separator: " ")
}
```

func stringSequence(n: Int) -> String {
    return (0...n).map(String.init).joined(separator: " ")
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Return a string containing space-delimited numbers starting from 0 upto n inclusive.
stringSequence(n: 0) == "0"
stringSequence(n: 5) == "0 1 2 3 4 5"
### Response:
```swift
func stringSequence(n: Int) -> String {
    return (0...n).map(String.init).joined(separator: " ")
}
```

func stringSequence(n: Int) -> String {
    return (0...n).map(String.init).joined(separator: " ")
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Return a string containing space-delimited numbers starting from 0 upto n inclusive.
stringSequence(n: 0) == "0"
stringSequence(n: 5) == "0 1 2 3 4 5"
### Response:
```swift
func stringSequence(n: Int) -> String {
    return (0...n).map(String.init).joined(separator: " ")
}
```

func stringSequence(n: Int) -> String {
    return (0...n).map(String.init).joined(separator: " ")
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Return a string containing space-delimited numbers starting from 0 upto n inclusive.
stringSequence(n: 0) == "0"
stringSequence(n: 5) == "0 1 2 3 4 5"
### Response:
```swift
func stringSequence(n: Int) -> String {
    return (0...n).map(String.init).joined(separator: " ")
}
```

func countDistinctCharacters(string: String) -> Int {
    return Set(string.lowercased()).count
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Given a string, find out how many distinct characters (regardless of case) does it consist of
countDistinctCharacters(string: "xyzXYZ") == 3
countDistinctCharacters(string: "Jerry") == 4
### Response:
```swift
func countDistinctCharacters(string: String) -> Int {
    return Set(string.lowercased()).count
}
```

func countDistinctCharacters(string: String) -> Int {
    return Set(string.lowercased()).count
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Given a string, find out how many distinct characters (regardless of case) does it consist of
countDistinctCharacters(string: "xyzXYZ") == 3
countDistinctCharacters(string: "Jerry") == 4
### Response:
```swift
func countDistinctCharacters(string: String) -> Int {
    return Set(string.lowercased()).count
}
```

func countDistinctCharacters(string: String) -> Int {
    return Set(string.lowercased()).count
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Given a string, find out how many distinct characters (regardless of case) does it consist of
countDistinctCharacters(string: "xyzXYZ") == 3
countDistinctCharacters(string: "Jerry") == 4
### Response:
```swift
func countDistinctCharacters(string: String) -> Int {
    return Set(string.lowercased()).count
}
```

func countDistinctCharacters(string: String) -> Int {
    return Set(string.lowercased()).count
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Given a string, find out how many distinct characters (regardless of case) does it consist of
countDistinctCharacters(string: "xyzXYZ") == 3
countDistinctCharacters(string: "Jerry") == 4
### Response:
```swift
func countDistinctCharacters(string: String) -> Int {
    return Set(string.lowercased()).count
}
```

func countDistinctCharacters(string: String) -> Int {
    return Set(string.lowercased()).count
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Given a string, find out how many distinct characters (regardless of case) does it consist of
countDistinctCharacters(string: "xyzXYZ") == 3
countDistinctCharacters(string: "Jerry") == 4
### Response:
```swift
func countDistinctCharacters(string: String) -> Int {
    return Set(string.lowercased()).count
}
```

func countDistinctCharacters(string: String) -> Int {
    return Set(string.lowercased()).count
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Given a string, find out how many distinct characters (regardless of case) does it consist of
countDistinctCharacters(string: "xyzXYZ") == 3
countDistinctCharacters(string: "Jerry") == 4
### Response:
```swift
func countDistinctCharacters(string: String) -> Int {
    return Set(string.lowercased()).count
}
```

func countDistinctCharacters(string: String) -> Int {
    return Set(string.lowercased()).count
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Given a string, find out how many distinct characters (regardless of case) does it consist of
countDistinctCharacters(string: "xyzXYZ") == 3
countDistinctCharacters(string: "Jerry") == 4
### Response:
```swift
func countDistinctCharacters(string: String) -> Int {
    return Set(string.lowercased()).count
}
```

func countDistinctCharacters(string: String) -> Int {
    return Set(string.lowercased()).count
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Given a string, find out how many distinct characters (regardless of case) does it consist of
countDistinctCharacters(string: "xyzXYZ") == 3
countDistinctCharacters(string: "Jerry") == 4
### Response:
```swift
func countDistinctCharacters(string: String) -> Int {
    return Set(string.lowercased()).count
}
```

func countDistinctCharacters(string: String) -> Int {
    return Set(string.lowercased()).count
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Given a string, find out how many distinct characters (regardless of case) does it consist of
countDistinctCharacters(string: "xyzXYZ") == 3
countDistinctCharacters(string: "Jerry") == 4
### Response:
```swift
func countDistinctCharacters(string: String) -> Int {
    return Set(string.lowercased()).count
}
```

func countDistinctCharacters(string: String) -> Int {
    return Set(string.lowercased()).count
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Given a string, find out how many distinct characters (regardless of case) does it consist of
countDistinctCharacters(string: "xyzXYZ") == 3
countDistinctCharacters(string: "Jerry") == 4
### Response:
```swift
func countDistinctCharacters(string: String) -> Int {
    return Set(string.lowercased()).count
}
```

func parseMusic(musicString: String) -> [Int] {
    var result = [Int]()
    var index = musicString.startIndex
    while index < musicString.endIndex {
        let note = musicString[index]
        switch note {
        case "o":
            result.append(4)
        case "o|":
            result.append(2)
        case ".|":
            result.append(1)
        default:
            break
        }
        index = musicString.index(index, offsetBy: 2)
    }
    return result
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Input to this function is a string representing musical notes in a special ASCII format.
Your task is to parse this string and return array of integers corresponding to how many beats does each
not last.
Here is a legend:
'o' - whole note, lasts four beats
'o|' - half note, lasts two beats
'.|' - quater note, lasts one beat
parseMusic(musicString: "o o| .| o| o| .| .| .| .| o o") == [4, 2, 1, 2, 2, 1, 1, 1, 1, 4, 4]
### Response:
```swift
func parseMusic(musicString: String) -> [Int] {
    var result = [Int]()
    var index = musicString.startIndex
    while index < musicString.endIndex {
        let note = musicString[index]
        switch note {
        case "o":
            result.append(4)
        case "o|":
            result.append(2)
        case ".|":
            result.append(1)
        default:
            break
        }
        index = musicString.index(index, offsetBy: 2)
    }
    return result
}
```

func parseMusic(musicString: String) -> [Int] {
    let notes = musicString.split(separator: " ")
    var result = [Int]()
    for note in notes {
        switch note {
        case "o":
            result.append(4)
        case "o|":
            result.append(2)
        case ".|":
            result.append(1)
        default:
            break
        }
    }
    return result
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Input to this function is a string representing musical notes in a special ASCII format.
Your task is to parse this string and return array of integers corresponding to how many beats does each
not last.
Here is a legend:
'o' - whole note, lasts four beats
'o|' - half note, lasts two beats
'.|' - quater note, lasts one beat
parseMusic(musicString: "o o| .| o| o| .| .| .| .| o o") == [4, 2, 1, 2, 2, 1, 1, 1, 1, 4, 4]
### Response:
```swift
func parseMusic(musicString: String) -> [Int] {
    let notes = musicString.split(separator: " ")
    var result = [Int]()
    for note in notes {
        switch note {
        case "o":
            result.append(4)
        case "o|":
            result.append(2)
        case ".|":
            result.append(1)
        default:
            break
        }
    }
    return result
}
```

func parseMusic(musicString: String) -> [Int] {
    return musicString.split(separator: " ").map {
        switch $0 {
        case "o":
            return 4
        case "o|":
            return 2
        case ".|":
            return 1
        default:
            return 0
        }
    }
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Input to this function is a string representing musical notes in a special ASCII format.
Your task is to parse this string and return array of integers corresponding to how many beats does each
not last.
Here is a legend:
'o' - whole note, lasts four beats
'o|' - half note, lasts two beats
'.|' - quater note, lasts one beat
parseMusic(musicString: "o o| .| o| o| .| .| .| .| o o") == [4, 2, 1, 2, 2, 1, 1, 1, 1, 4, 4]
### Response:
```swift
func parseMusic(musicString: String) -> [Int] {
    return musicString.split(separator: " ").map {
        switch $0 {
        case "o":
            return 4
        case "o|":
            return 2
        case ".|":
            return 1
        default:
            return 0
        }
    }
}
```

func parseMusic(musicString: String) -> [Int] {
    return musicString.split(separator: " ").map {
        switch $0 {
        case "o": return 4
        case "o|": return 2
        case ".|": return 1
        default: fatalError("Invalid note")
        }
    }
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Input to this function is a string representing musical notes in a special ASCII format.
Your task is to parse this string and return array of integers corresponding to how many beats does each
not last.
Here is a legend:
'o' - whole note, lasts four beats
'o|' - half note, lasts two beats
'.|' - quater note, lasts one beat
parseMusic(musicString: "o o| .| o| o| .| .| .| .| o o") == [4, 2, 1, 2, 2, 1, 1, 1, 1, 4, 4]
### Response:
```swift
func parseMusic(musicString: String) -> [Int] {
    return musicString.split(separator: " ").map {
        switch $0 {
        case "o": return 4
        case "o|": return 2
        case ".|": return 1
        default: fatalError("Invalid note")
        }
    }
}
```

func parseMusic(musicString: String) -> [Int] {
    let notes = musicString.split(separator: " ")
    return notes.map { note in
        switch note {
        case "o":
            return 4
        case "o|":
            return 2
        case ".|":
            return 1
        default:
            return 0
        }
    }
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Input to this function is a string representing musical notes in a special ASCII format.
Your task is to parse this string and return array of integers corresponding to how many beats does each
not last.
Here is a legend:
'o' - whole note, lasts four beats
'o|' - half note, lasts two beats
'.|' - quater note, lasts one beat
parseMusic(musicString: "o o| .| o| o| .| .| .| .| o o") == [4, 2, 1, 2, 2, 1, 1, 1, 1, 4, 4]
### Response:
```swift
func parseMusic(musicString: String) -> [Int] {
    let notes = musicString.split(separator: " ")
    return notes.map { note in
        switch note {
        case "o":
            return 4
        case "o|":
            return 2
        case ".|":
            return 1
        default:
            return 0
        }
    }
}
```

func parseMusic(musicString: String) -> [Int] {
    return musicString.split(separator: " ").map {
        switch $0 {
        case "o":
            return 4
        case "o|":
            return 2
        case ".|":
            return 1
        default:
            return 0
        }
    }
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Input to this function is a string representing musical notes in a special ASCII format.
Your task is to parse this string and return array of integers corresponding to how many beats does each
not last.
Here is a legend:
'o' - whole note, lasts four beats
'o|' - half note, lasts two beats
'.|' - quater note, lasts one beat
parseMusic(musicString: "o o| .| o| o| .| .| .| .| o o") == [4, 2, 1, 2, 2, 1, 1, 1, 1, 4, 4]
### Response:
```swift
func parseMusic(musicString: String) -> [Int] {
    return musicString.split(separator: " ").map {
        switch $0 {
        case "o":
            return 4
        case "o|":
            return 2
        case ".|":
            return 1
        default:
            return 0
        }
    }
}
```

func parseMusic(musicString: String) -> [Int] {
    let notes = musicString.components(separatedBy: " ")
    return notes.map { note in
        switch note {
        case "o":
            return 4
        case "o|":
            return 2
        case ".|":
            return 1
        default:
            return 0
        }
    }
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Input to this function is a string representing musical notes in a special ASCII format.
Your task is to parse this string and return array of integers corresponding to how many beats does each
not last.
Here is a legend:
'o' - whole note, lasts four beats
'o|' - half note, lasts two beats
'.|' - quater note, lasts one beat
parseMusic(musicString: "o o| .| o| o| .| .| .| .| o o") == [4, 2, 1, 2, 2, 1, 1, 1, 1, 4, 4]
### Response:
```swift
func parseMusic(musicString: String) -> [Int] {
    let notes = musicString.components(separatedBy: " ")
    return notes.map { note in
        switch note {
        case "o":
            return 4
        case "o|":
            return 2
        case ".|":
            return 1
        default:
            return 0
        }
    }
}
```

func parseMusic(musicString: String) -> [Int] {
    var notes = [Int]()
    let noteDurations = ["o": 4, "o|": 2, ".|": 1]
    let noteString = musicString.replacingOccurrences(of: " ", with: "")
    for note in noteString {
        if let duration = noteDurations[String(note)] {
            notes.append(duration)
        }
    }
    return notes
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Input to this function is a string representing musical notes in a special ASCII format.
Your task is to parse this string and return array of integers corresponding to how many beats does each
not last.
Here is a legend:
'o' - whole note, lasts four beats
'o|' - half note, lasts two beats
'.|' - quater note, lasts one beat
parseMusic(musicString: "o o| .| o| o| .| .| .| .| o o") == [4, 2, 1, 2, 2, 1, 1, 1, 1, 4, 4]
### Response:
```swift
func parseMusic(musicString: String) -> [Int] {
    var notes = [Int]()
    let noteDurations = ["o": 4, "o|": 2, ".|": 1]
    let noteString = musicString.replacingOccurrences(of: " ", with: "")
    for note in noteString {
        if let duration = noteDurations[String(note)] {
            notes.append(duration)
        }
    }
    return notes
}
```

func parseMusic(musicString: String) -> [Int] {
    var result = [Int]()
    let notes = musicString.split(separator: " ")
    for note in notes {
        switch note {
        case "o":
            result.append(4)
        case "o|":
            result.append(2)
        case ".|":
            result.append(1)
        default:
            break
        }
    }
    return result
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Input to this function is a string representing musical notes in a special ASCII format.
Your task is to parse this string and return array of integers corresponding to how many beats does each
not last.
Here is a legend:
'o' - whole note, lasts four beats
'o|' - half note, lasts two beats
'.|' - quater note, lasts one beat
parseMusic(musicString: "o o| .| o| o| .| .| .| .| o o") == [4, 2, 1, 2, 2, 1, 1, 1, 1, 4, 4]
### Response:
```swift
func parseMusic(musicString: String) -> [Int] {
    var result = [Int]()
    let notes = musicString.split(separator: " ")
    for note in notes {
        switch note {
        case "o":
            result.append(4)
        case "o|":
            result.append(2)
        case ".|":
            result.append(1)
        default:
            break
        }
    }
    return result
}
```

func parseMusic(musicString: String) -> [Int] {
    var result = [Int]()
    var current = ""
    for char in musicString {
        if char == "|" {
            result.append(parseNote(note: current))
            current = ""
        } else {
            current.append(char)
        }
    }
    return result
}

func parseNote(note: String) -> Int {
    switch note {
    case "o":
        return 4
    case "o|":
        return 2
    case ".|":
        return 1
    default:
        return 0
    }
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Input to this function is a string representing musical notes in a special ASCII format.
Your task is to parse this string and return array of integers corresponding to how many beats does each
not last.
Here is a legend:
'o' - whole note, lasts four beats
'o|' - half note, lasts two beats
'.|' - quater note, lasts one beat
parseMusic(musicString: "o o| .| o| o| .| .| .| .| o o") == [4, 2, 1, 2, 2, 1, 1, 1, 1, 4, 4]
### Response:
```swift
func parseMusic(musicString: String) -> [Int] {
    var result = [Int]()
    var current = ""
    for char in musicString {
        if char == "|" {
            result.append(parseNote(note: current))
            current = ""
        } else {
            current.append(char)
        }
    }
    return result
}

func parseNote(note: String) -> Int {
    switch note {
    case "o":
        return 4
    case "o|":
        return 2
    case ".|":
        return 1
    default:
        return 0
    }
}
```

func howManyTimes(string: String, substring: String) -> Int {
    var count = 0
    var index = string.startIndex
    while index < string.endIndex {
        if let range = string.range(of: substring, options: .anchored, range: index..<string.endIndex) {
            count += 1
            index = range.upperBound
        } else {
            break
        }
    }
    return count
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Find how many times a given substring can be found in the original string. Count overlaping cases.
howManyTimes(string: "", substring: "a") == 0
howManyTimes(string: "aaa", substring: "a") == 3
howManyTimes(string: "aaaa", substring: "aa") == 3
### Response:
```swift
func howManyTimes(string: String, substring: String) -> Int {
    var count = 0
    var index = string.startIndex
    while index < string.endIndex {
        if let range = string.range(of: substring, options: .anchored, range: index..<string.endIndex) {
            count += 1
            index = range.upperBound
        } else {
            break
        }
    }
    return count
}
```

func howManyTimes(string: String, substring: String) -> Int {
    var count = 0
    var index = string.startIndex
    while index < string.endIndex {
        if let range = string.range(of: substring, options: .anchored, range: index..<string.endIndex) {
            count += 1
            index = range.upperBound
        } else {
            break
        }
    }
    return count
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Find how many times a given substring can be found in the original string. Count overlaping cases.
howManyTimes(string: "", substring: "a") == 0
howManyTimes(string: "aaa", substring: "a") == 3
howManyTimes(string: "aaaa", substring: "aa") == 3
### Response:
```swift
func howManyTimes(string: String, substring: String) -> Int {
    var count = 0
    var index = string.startIndex
    while index < string.endIndex {
        if let range = string.range(of: substring, options: .anchored, range: index..<string.endIndex) {
            count += 1
            index = range.upperBound
        } else {
            break
        }
    }
    return count
}
```

func howManyTimes(string: String, substring: String) -> Int {
    var count = 0
    for i in 0..<string.count {
        if string.count - i < substring.count {
            break
        }
        let sub = string[string.index(string.startIndex, offsetBy: i)..<string.index(string.startIndex, offsetBy: i + substring.count)]
        if sub == substring {
            count += 1
        }
    }
    return count
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Find how many times a given substring can be found in the original string. Count overlaping cases.
howManyTimes(string: "", substring: "a") == 0
howManyTimes(string: "aaa", substring: "a") == 3
howManyTimes(string: "aaaa", substring: "aa") == 3
### Response:
```swift
func howManyTimes(string: String, substring: String) -> Int {
    var count = 0
    for i in 0..<string.count {
        if string.count - i < substring.count {
            break
        }
        let sub = string[string.index(string.startIndex, offsetBy: i)..<string.index(string.startIndex, offsetBy: i + substring.count)]
        if sub == substring {
            count += 1
        }
    }
    return count
}
```

func howManyTimes(string: String, substring: String) -> Int {
    var count = 0
    var index = string.startIndex
    while index < string.endIndex {
        if let range = string.range(of: substring, options: .anchored, range: index..<string.endIndex) {
            count += 1
            index = range.upperBound
        } else {
            break
        }
    }
    return count
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Find how many times a given substring can be found in the original string. Count overlaping cases.
howManyTimes(string: "", substring: "a") == 0
howManyTimes(string: "aaa", substring: "a") == 3
howManyTimes(string: "aaaa", substring: "aa") == 3
### Response:
```swift
func howManyTimes(string: String, substring: String) -> Int {
    var count = 0
    var index = string.startIndex
    while index < string.endIndex {
        if let range = string.range(of: substring, options: .anchored, range: index..<string.endIndex) {
            count += 1
            index = range.upperBound
        } else {
            break
        }
    }
    return count
}
```

func howManyTimes(string: String, substring: String) -> Int {
    var count = 0
    let stringLength = string.count
    let substringLength = substring.count
    for i in 0..<stringLength {
        if i + substringLength <= stringLength {
            if string[string.index(string.startIndex, offsetBy: i)] == substring[substring.startIndex] {
                var j = 1
                while j < substringLength {
                    if string[string.index(string.startIndex, offsetBy: i + j)] != substring[substring.index(substring.startIndex, offsetBy: j)] {
                        break
                    }
                    j += 1
                }
                if j == substringLength {
                    count += 1
                }
            }
        }
    }
    return count
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Find how many times a given substring can be found in the original string. Count overlaping cases.
howManyTimes(string: "", substring: "a") == 0
howManyTimes(string: "aaa", substring: "a") == 3
howManyTimes(string: "aaaa", substring: "aa") == 3
### Response:
```swift
func howManyTimes(string: String, substring: String) -> Int {
    var count = 0
    let stringLength = string.count
    let substringLength = substring.count
    for i in 0..<stringLength {
        if i + substringLength <= stringLength {
            if string[string.index(string.startIndex, offsetBy: i)] == substring[substring.startIndex] {
                var j = 1
                while j < substringLength {
                    if string[string.index(string.startIndex, offsetBy: i + j)] != substring[substring.index(substring.startIndex, offsetBy: j)] {
                        break
                    }
                    j += 1
                }
                if j == substringLength {
                    count += 1
                }
            }
        }
    }
    return count
}
```

func howManyTimes(string: String, substring: String) -> Int {
    var count = 0
    var index = string.startIndex
    while let range = string.range(of: substring, range: index..<string.endIndex) {
        count += 1
        index = range.upperBound
    }
    return count
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Find how many times a given substring can be found in the original string. Count overlaping cases.
howManyTimes(string: "", substring: "a") == 0
howManyTimes(string: "aaa", substring: "a") == 3
howManyTimes(string: "aaaa", substring: "aa") == 3
### Response:
```swift
func howManyTimes(string: String, substring: String) -> Int {
    var count = 0
    var index = string.startIndex
    while let range = string.range(of: substring, range: index..<string.endIndex) {
        count += 1
        index = range.upperBound
    }
    return count
}
```

func howManyTimes(string: String, substring: String) -> Int {
    var count = 0
    for i in 0..<string.count {
        if string[string.index(string.startIndex, offsetBy: i)] == substring[substring.index(substring.startIndex, offsetBy: 0)] {
            var j = 1
            while j < substring.count {
                if string[string.index(string.startIndex, offsetBy: i + j)] == substring[substring.index(substring.startIndex, offsetBy: j)] {
                    j += 1
                } else {
                    break
                }
            }
            if j == substring.count {
                count += 1
            }
        }
    }
    return count
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Find how many times a given substring can be found in the original string. Count overlaping cases.
howManyTimes(string: "", substring: "a") == 0
howManyTimes(string: "aaa", substring: "a") == 3
howManyTimes(string: "aaaa", substring: "aa") == 3
### Response:
```swift
func howManyTimes(string: String, substring: String) -> Int {
    var count = 0
    for i in 0..<string.count {
        if string[string.index(string.startIndex, offsetBy: i)] == substring[substring.index(substring.startIndex, offsetBy: 0)] {
            var j = 1
            while j < substring.count {
                if string[string.index(string.startIndex, offsetBy: i + j)] == substring[substring.index(substring.startIndex, offsetBy: j)] {
                    j += 1
                } else {
                    break
                }
            }
            if j == substring.count {
                count += 1
            }
        }
    }
    return count
}
```

func howManyTimes(string: String, substring: String) -> Int {
    var count = 0
    let stringArray = Array(string)
    let substringArray = Array(substring)
    for i in 0..<stringArray.count {
        if stringArray[i] == substringArray[0] {
            var j = 0
            while i+j < stringArray.count && j < substringArray.count {
                if stringArray[i+j] == substringArray[j] {
                    j += 1
                } else {
                    break
                }
            }
            if j == substringArray.count {
                count += 1
            }
        }
    }
    return count
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Find how many times a given substring can be found in the original string. Count overlaping cases.
howManyTimes(string: "", substring: "a") == 0
howManyTimes(string: "aaa", substring: "a") == 3
howManyTimes(string: "aaaa", substring: "aa") == 3
### Response:
```swift
func howManyTimes(string: String, substring: String) -> Int {
    var count = 0
    let stringArray = Array(string)
    let substringArray = Array(substring)
    for i in 0..<stringArray.count {
        if stringArray[i] == substringArray[0] {
            var j = 0
            while i+j < stringArray.count && j < substringArray.count {
                if stringArray[i+j] == substringArray[j] {
                    j += 1
                } else {
                    break
                }
            }
            if j == substringArray.count {
                count += 1
            }
        }
    }
    return count
}
```

func howManyTimes(string: String, substring: String) -> Int {
    return string.count - string.replacingOccurrences(of: substring, with: "").count
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Find how many times a given substring can be found in the original string. Count overlaping cases.
howManyTimes(string: "", substring: "a") == 0
howManyTimes(string: "aaa", substring: "a") == 3
howManyTimes(string: "aaaa", substring: "aa") == 3
### Response:
```swift
func howManyTimes(string: String, substring: String) -> Int {
    return string.count - string.replacingOccurrences(of: substring, with: "").count
}
```

func howManyTimes(string: String, substring: String) -> Int {
    var count = 0
    var i = string.startIndex
    while i < string.endIndex {
        if let index = string[i...].range(of: substring)?.lowerBound {
            count += 1
            i = index
        } else {
            break
        }
    }
    return count
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Find how many times a given substring can be found in the original string. Count overlaping cases.
howManyTimes(string: "", substring: "a") == 0
howManyTimes(string: "aaa", substring: "a") == 3
howManyTimes(string: "aaaa", substring: "aa") == 3
### Response:
```swift
func howManyTimes(string: String, substring: String) -> Int {
    var count = 0
    var i = string.startIndex
    while i < string.endIndex {
        if let index = string[i...].range(of: substring)?.lowerBound {
            count += 1
            i = index
        } else {
            break
        }
    }
    return count
}
```

func sortNumbers(numbers: String) -> String {
    let numbers = numbers.split(separator: " ")
    return numbers.sorted().joined(separator: " ")
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Input is a space-delimited string of numberals from 'zero' to 'nine'.
Valid choices are 'zero', 'one', 'two', 'three', 'four', 'five', 'six', 'seven', 'eight' and 'nine'.
Return the string with numbers sorted from smallest to largest
sortNumbers(numbers: "three one five") == "one three five"
### Response:
```swift
func sortNumbers(numbers: String) -> String {
    let numbers = numbers.split(separator: " ")
    return numbers.sorted().joined(separator: " ")
}
```

func sortNumbers(numbers: String) -> String {
    let numbers = numbers.split(separator: " ")
    let sortedNumbers = numbers.sorted {
        return $0.first!.asciiValue! < $1.first!.asciiValue!
    }
    return sortedNumbers.joined(separator: " ")
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Input is a space-delimited string of numberals from 'zero' to 'nine'.
Valid choices are 'zero', 'one', 'two', 'three', 'four', 'five', 'six', 'seven', 'eight' and 'nine'.
Return the string with numbers sorted from smallest to largest
sortNumbers(numbers: "three one five") == "one three five"
### Response:
```swift
func sortNumbers(numbers: String) -> String {
    let numbers = numbers.split(separator: " ")
    let sortedNumbers = numbers.sorted {
        return $0.first!.asciiValue! < $1.first!.asciiValue!
    }
    return sortedNumbers.joined(separator: " ")
}
```

func sortNumbers(numbers: String) -> String {
    return numbers.split(separator: " ").sorted().joined(separator: " ")
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Input is a space-delimited string of numberals from 'zero' to 'nine'.
Valid choices are 'zero', 'one', 'two', 'three', 'four', 'five', 'six', 'seven', 'eight' and 'nine'.
Return the string with numbers sorted from smallest to largest
sortNumbers(numbers: "three one five") == "one three five"
### Response:
```swift
func sortNumbers(numbers: String) -> String {
    return numbers.split(separator: " ").sorted().joined(separator: " ")
}
```

func sortNumbers(numbers: String) -> String {
    return numbers.split(separator: " ").sorted().joined(separator: " ")
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Input is a space-delimited string of numberals from 'zero' to 'nine'.
Valid choices are 'zero', 'one', 'two', 'three', 'four', 'five', 'six', 'seven', 'eight' and 'nine'.
Return the string with numbers sorted from smallest to largest
sortNumbers(numbers: "three one five") == "one three five"
### Response:
```swift
func sortNumbers(numbers: String) -> String {
    return numbers.split(separator: " ").sorted().joined(separator: " ")
}
```

func sortNumbers(numbers: String) -> String {
    let numbers = numbers.split(separator: " ")
    return numbers.sorted().joined(separator: " ")
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Input is a space-delimited string of numberals from 'zero' to 'nine'.
Valid choices are 'zero', 'one', 'two', 'three', 'four', 'five', 'six', 'seven', 'eight' and 'nine'.
Return the string with numbers sorted from smallest to largest
sortNumbers(numbers: "three one five") == "one three five"
### Response:
```swift
func sortNumbers(numbers: String) -> String {
    let numbers = numbers.split(separator: " ")
    return numbers.sorted().joined(separator: " ")
}
```

func sortNumbers(numbers: String) -> String {
    let numbers = numbers.split(separator: " ")
    let sortedNumbers = numbers.sorted {
        $0.first!.asciiValue! < $1.first!.asciiValue!
    }
    return sortedNumbers.joined(separator: " ")
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Input is a space-delimited string of numberals from 'zero' to 'nine'.
Valid choices are 'zero', 'one', 'two', 'three', 'four', 'five', 'six', 'seven', 'eight' and 'nine'.
Return the string with numbers sorted from smallest to largest
sortNumbers(numbers: "three one five") == "one three five"
### Response:
```swift
func sortNumbers(numbers: String) -> String {
    let numbers = numbers.split(separator: " ")
    let sortedNumbers = numbers.sorted {
        $0.first!.asciiValue! < $1.first!.asciiValue!
    }
    return sortedNumbers.joined(separator: " ")
}
```

func sortNumbers(numbers: String) -> String {
    return numbers.split(separator: " ").sorted().joined(separator: " ")
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Input is a space-delimited string of numberals from 'zero' to 'nine'.
Valid choices are 'zero', 'one', 'two', 'three', 'four', 'five', 'six', 'seven', 'eight' and 'nine'.
Return the string with numbers sorted from smallest to largest
sortNumbers(numbers: "three one five") == "one three five"
### Response:
```swift
func sortNumbers(numbers: String) -> String {
    return numbers.split(separator: " ").sorted().joined(separator: " ")
}
```

func sortNumbers(numbers: String) -> String {
    let numbersArray = numbers.split(separator: " ")
    let sortedNumbers = numbersArray.sorted()
    return sortedNumbers.joined(separator: " ")
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Input is a space-delimited string of numberals from 'zero' to 'nine'.
Valid choices are 'zero', 'one', 'two', 'three', 'four', 'five', 'six', 'seven', 'eight' and 'nine'.
Return the string with numbers sorted from smallest to largest
sortNumbers(numbers: "three one five") == "one three five"
### Response:
```swift
func sortNumbers(numbers: String) -> String {
    let numbersArray = numbers.split(separator: " ")
    let sortedNumbers = numbersArray.sorted()
    return sortedNumbers.joined(separator: " ")
}
```

func sortNumbers(numbers: String) -> String {
    let numbers = numbers.split(separator: " ")
    return numbers.sorted().joined(separator: " ")
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Input is a space-delimited string of numberals from 'zero' to 'nine'.
Valid choices are 'zero', 'one', 'two', 'three', 'four', 'five', 'six', 'seven', 'eight' and 'nine'.
Return the string with numbers sorted from smallest to largest
sortNumbers(numbers: "three one five") == "one three five"
### Response:
```swift
func sortNumbers(numbers: String) -> String {
    let numbers = numbers.split(separator: " ")
    return numbers.sorted().joined(separator: " ")
}
```

func sortNumbers(numbers: String) -> String {
    let numbersArray = numbers.split(separator: " ")
    let sortedNumbersArray = numbersArray.sorted {
        $0.first!.asciiValue! < $1.first!.asciiValue!
    }
    return sortedNumbersArray.joined(separator: " ")
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Input is a space-delimited string of numberals from 'zero' to 'nine'.
Valid choices are 'zero', 'one', 'two', 'three', 'four', 'five', 'six', 'seven', 'eight' and 'nine'.
Return the string with numbers sorted from smallest to largest
sortNumbers(numbers: "three one five") == "one three five"
### Response:
```swift
func sortNumbers(numbers: String) -> String {
    let numbersArray = numbers.split(separator: " ")
    let sortedNumbersArray = numbersArray.sorted {
        $0.first!.asciiValue! < $1.first!.asciiValue!
    }
    return sortedNumbersArray.joined(separator: " ")
}
```

func findClosestElements(numbers: [Double]) -> (Double, Double) {
    var closestPair: (Double, Double) = (0, 0)
    var minDistance: Double = Double.infinity
    for i in 0..<numbers.count - 1 {
        for j in i + 1..<numbers.count {
            let distance = numbers[i] - numbers[j]
            if distance < 0 {
                distance = -distance
            }
            if distance < minDistance {
                minDistance = distance
                closestPair = (numbers[i], numbers[j])
            }
        }
    }
    return closestPair
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
From a supplied array of numbers (of length at least two) select and return two that are the closest to each
other and return them in order (smaller number, larger number).
findClosestElements(numbers: [1.0, 2.0, 3.0, 4.0, 5.0, 2.2]) == (2.0, 2.2)
findClosestElements(numbers: [1.0, 2.0, 3.0, 4.0, 5.0, 2.0]) == (2.0, 2.0)
### Response:
```swift
func findClosestElements(numbers: [Double]) -> (Double, Double) {
    var closestPair: (Double, Double) = (0, 0)
    var minDistance: Double = Double.infinity
    for i in 0..<numbers.count - 1 {
        for j in i + 1..<numbers.count {
            let distance = numbers[i] - numbers[j]
            if distance < 0 {
                distance = -distance
            }
            if distance < minDistance {
                minDistance = distance
                closestPair = (numbers[i], numbers[j])
            }
        }
    }
    return closestPair
}
```

func findClosestElements(numbers: [Double]) -> (Double, Double) {
    var result: (Double, Double) = (0, 0)
    var minDiff: Double = Double.greatestFiniteMagnitude
    for i in 0..<numbers.count {
        for j in i+1..<numbers.count {
            let diff = abs(numbers[i] - numbers[j])
            if diff < minDiff {
                minDiff = diff
                result = (numbers[i], numbers[j])
            }
        }
    }
    return result
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
From a supplied array of numbers (of length at least two) select and return two that are the closest to each
other and return them in order (smaller number, larger number).
findClosestElements(numbers: [1.0, 2.0, 3.0, 4.0, 5.0, 2.2]) == (2.0, 2.2)
findClosestElements(numbers: [1.0, 2.0, 3.0, 4.0, 5.0, 2.0]) == (2.0, 2.0)
### Response:
```swift
func findClosestElements(numbers: [Double]) -> (Double, Double) {
    var result: (Double, Double) = (0, 0)
    var minDiff: Double = Double.greatestFiniteMagnitude
    for i in 0..<numbers.count {
        for j in i+1..<numbers.count {
            let diff = abs(numbers[i] - numbers[j])
            if diff < minDiff {
                minDiff = diff
                result = (numbers[i], numbers[j])
            }
        }
    }
    return result
}
```

func findClosestElements(numbers: [Double]) -> (Double, Double) {
    var minDiff: Double = Double.greatestFiniteMagnitude
    var first: Double = 0
    var second: Double = 0
    for i in 0..<numbers.count {
        for j in i+1..<numbers.count {
            let diff = abs(numbers[i] - numbers[j])
            if diff < minDiff {
                minDiff = diff
                first = numbers[i]
                second = numbers[j]
            }
        }
    }
    return (first, second)
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
From a supplied array of numbers (of length at least two) select and return two that are the closest to each
other and return them in order (smaller number, larger number).
findClosestElements(numbers: [1.0, 2.0, 3.0, 4.0, 5.0, 2.2]) == (2.0, 2.2)
findClosestElements(numbers: [1.0, 2.0, 3.0, 4.0, 5.0, 2.0]) == (2.0, 2.0)
### Response:
```swift
func findClosestElements(numbers: [Double]) -> (Double, Double) {
    var minDiff: Double = Double.greatestFiniteMagnitude
    var first: Double = 0
    var second: Double = 0
    for i in 0..<numbers.count {
        for j in i+1..<numbers.count {
            let diff = abs(numbers[i] - numbers[j])
            if diff < minDiff {
                minDiff = diff
                first = numbers[i]
                second = numbers[j]
            }
        }
    }
    return (first, second)
}
```

func findClosestElements(numbers: [Double]) -> (Double, Double) {
    var min = numbers[0]
    var max = numbers[0]
    for i in 1..<numbers.count {
        let diff = numbers[i] - numbers[i - 1]
        if diff < 0 {
            min = numbers[i]
        } else if diff > 0 {
            max = numbers[i]
        }
    }
    return (min, max)
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
From a supplied array of numbers (of length at least two) select and return two that are the closest to each
other and return them in order (smaller number, larger number).
findClosestElements(numbers: [1.0, 2.0, 3.0, 4.0, 5.0, 2.2]) == (2.0, 2.2)
findClosestElements(numbers: [1.0, 2.0, 3.0, 4.0, 5.0, 2.0]) == (2.0, 2.0)
### Response:
```swift
func findClosestElements(numbers: [Double]) -> (Double, Double) {
    var min = numbers[0]
    var max = numbers[0]
    for i in 1..<numbers.count {
        let diff = numbers[i] - numbers[i - 1]
        if diff < 0 {
            min = numbers[i]
        } else if diff > 0 {
            max = numbers[i]
        }
    }
    return (min, max)
}
```

func findClosestElements(numbers: [Double]) -> (Double, Double) {
    var minDiff: Double = Double.infinity
    var first: Double = 0
    var second: Double = 0
    for i in 0..<numbers.count {
        for j in i+1..<numbers.count {
            let diff = abs(numbers[i] - numbers[j])
            if diff < minDiff {
                minDiff = diff
                first = numbers[i]
                second = numbers[j]
            }
        }
    }
    return (first, second)
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
From a supplied array of numbers (of length at least two) select and return two that are the closest to each
other and return them in order (smaller number, larger number).
findClosestElements(numbers: [1.0, 2.0, 3.0, 4.0, 5.0, 2.2]) == (2.0, 2.2)
findClosestElements(numbers: [1.0, 2.0, 3.0, 4.0, 5.0, 2.0]) == (2.0, 2.0)
### Response:
```swift
func findClosestElements(numbers: [Double]) -> (Double, Double) {
    var minDiff: Double = Double.infinity
    var first: Double = 0
    var second: Double = 0
    for i in 0..<numbers.count {
        for j in i+1..<numbers.count {
            let diff = abs(numbers[i] - numbers[j])
            if diff < minDiff {
                minDiff = diff
                first = numbers[i]
                second = numbers[j]
            }
        }
    }
    return (first, second)
}
```

func findClosestElements(numbers: [Double]) -> (Double, Double) {
    var result: (Double, Double) = (0.0, 0.0)
    var minDistance: Double = Double.infinity
    for i in 0..<numbers.count {
        for j in i+1..<numbers.count {
            let distance = abs(numbers[i] - numbers[j])
            if distance < minDistance {
                minDistance = distance
                result = (numbers[i], numbers[j])
            }
        }
    }
    return result
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
From a supplied array of numbers (of length at least two) select and return two that are the closest to each
other and return them in order (smaller number, larger number).
findClosestElements(numbers: [1.0, 2.0, 3.0, 4.0, 5.0, 2.2]) == (2.0, 2.2)
findClosestElements(numbers: [1.0, 2.0, 3.0, 4.0, 5.0, 2.0]) == (2.0, 2.0)
### Response:
```swift
func findClosestElements(numbers: [Double]) -> (Double, Double) {
    var result: (Double, Double) = (0.0, 0.0)
    var minDistance: Double = Double.infinity
    for i in 0..<numbers.count {
        for j in i+1..<numbers.count {
            let distance = abs(numbers[i] - numbers[j])
            if distance < minDistance {
                minDistance = distance
                result = (numbers[i], numbers[j])
            }
        }
    }
    return result
}
```

func findClosestElements(numbers: [Double]) -> (Double, Double) {
    var result: (Double, Double) = (0, 0)
    var minDiff: Double = Double.infinity
    var minDiffIndex: Int = 0
    for i in 0..<numbers.count - 1 {
        let diff = abs(numbers[i] - numbers[i + 1])
        if diff < minDiff {
            minDiff = diff
            minDiffIndex = i
        }
    }
    result = (numbers[minDiffIndex], numbers[minDiffIndex + 1])
    return result
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
From a supplied array of numbers (of length at least two) select and return two that are the closest to each
other and return them in order (smaller number, larger number).
findClosestElements(numbers: [1.0, 2.0, 3.0, 4.0, 5.0, 2.2]) == (2.0, 2.2)
findClosestElements(numbers: [1.0, 2.0, 3.0, 4.0, 5.0, 2.0]) == (2.0, 2.0)
### Response:
```swift
func findClosestElements(numbers: [Double]) -> (Double, Double) {
    var result: (Double, Double) = (0, 0)
    var minDiff: Double = Double.infinity
    var minDiffIndex: Int = 0
    for i in 0..<numbers.count - 1 {
        let diff = abs(numbers[i] - numbers[i + 1])
        if diff < minDiff {
            minDiff = diff
            minDiffIndex = i
        }
    }
    result = (numbers[minDiffIndex], numbers[minDiffIndex + 1])
    return result
}
```

func findClosestElements(numbers: [Double]) -> (Double, Double) {
    var result: (Double, Double) = (0.0, 0.0)
    var minDiff: Double = Double.greatestFiniteMagnitude
    for i in 0..<numbers.count {
        for j in i+1..<numbers.count {
            let diff = abs(numbers[i] - numbers[j])
            if diff < minDiff {
                minDiff = diff
                result = (numbers[i], numbers[j])
            }
        }
    }
    return result
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
From a supplied array of numbers (of length at least two) select and return two that are the closest to each
other and return them in order (smaller number, larger number).
findClosestElements(numbers: [1.0, 2.0, 3.0, 4.0, 5.0, 2.2]) == (2.0, 2.2)
findClosestElements(numbers: [1.0, 2.0, 3.0, 4.0, 5.0, 2.0]) == (2.0, 2.0)
### Response:
```swift
func findClosestElements(numbers: [Double]) -> (Double, Double) {
    var result: (Double, Double) = (0.0, 0.0)
    var minDiff: Double = Double.greatestFiniteMagnitude
    for i in 0..<numbers.count {
        for j in i+1..<numbers.count {
            let diff = abs(numbers[i] - numbers[j])
            if diff < minDiff {
                minDiff = diff
                result = (numbers[i], numbers[j])
            }
        }
    }
    return result
}
```

func findClosestElements(numbers: [Double]) -> (Double, Double) {
    var result: (Double, Double) = (0, 0)
    var minDiff: Double = Double.infinity
    for i in 0..<numbers.count {
        for j in i+1..<numbers.count {
            let diff = abs(numbers[i] - numbers[j])
            if diff < minDiff {
                result = (numbers[i], numbers[j])
                minDiff = diff
            }
        }
    }
    return result
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
From a supplied array of numbers (of length at least two) select and return two that are the closest to each
other and return them in order (smaller number, larger number).
findClosestElements(numbers: [1.0, 2.0, 3.0, 4.0, 5.0, 2.2]) == (2.0, 2.2)
findClosestElements(numbers: [1.0, 2.0, 3.0, 4.0, 5.0, 2.0]) == (2.0, 2.0)
### Response:
```swift
func findClosestElements(numbers: [Double]) -> (Double, Double) {
    var result: (Double, Double) = (0, 0)
    var minDiff: Double = Double.infinity
    for i in 0..<numbers.count {
        for j in i+1..<numbers.count {
            let diff = abs(numbers[i] - numbers[j])
            if diff < minDiff {
                result = (numbers[i], numbers[j])
                minDiff = diff
            }
        }
    }
    return result
}
```

func findClosestElements(numbers: [Double]) -> (Double, Double) {
    var result: (Double, Double) = (0, 0)
    var min = Double.infinity
    for i in 0..<numbers.count {
        for j in i+1..<numbers.count {
            let diff = abs(numbers[i] - numbers[j])
            if diff < min {
                min = diff
                result = (numbers[i], numbers[j])
            }
        }
    }
    return result
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
From a supplied array of numbers (of length at least two) select and return two that are the closest to each
other and return them in order (smaller number, larger number).
findClosestElements(numbers: [1.0, 2.0, 3.0, 4.0, 5.0, 2.2]) == (2.0, 2.2)
findClosestElements(numbers: [1.0, 2.0, 3.0, 4.0, 5.0, 2.0]) == (2.0, 2.0)
### Response:
```swift
func findClosestElements(numbers: [Double]) -> (Double, Double) {
    var result: (Double, Double) = (0, 0)
    var min = Double.infinity
    for i in 0..<numbers.count {
        for j in i+1..<numbers.count {
            let diff = abs(numbers[i] - numbers[j])
            if diff < min {
                min = diff
                result = (numbers[i], numbers[j])
            }
        }
    }
    return result
}
```

func rescaleToUnit(numbers: [Double]) -> [Double] {
    let min = numbers.min()!
    let max = numbers.max()!
    return numbers.map { (number) -> Double in
        return (number - min) / (max - min)
    }
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Given array of numbers (of at least two elements), apply a linear transform to that array,
such that the smallest number will become 0 and the largest will become 1
rescaleToUnit(numbers: [1.0, 2.0, 3.0, 4.0, 5.0]) == [0.0, 0.25, 0.5, 0.75, 1.0]
### Response:
```swift
func rescaleToUnit(numbers: [Double]) -> [Double] {
    let min = numbers.min()!
    let max = numbers.max()!
    return numbers.map { (number) -> Double in
        return (number - min) / (max - min)
    }
}
```

func rescaleToUnit(numbers: [Double]) -> [Double] {
    let min = numbers.min()!
    let max = numbers.max()!
    let range = max - min
    return numbers.map { (number) -> Double in
        return (number - min) / range
    }
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Given array of numbers (of at least two elements), apply a linear transform to that array,
such that the smallest number will become 0 and the largest will become 1
rescaleToUnit(numbers: [1.0, 2.0, 3.0, 4.0, 5.0]) == [0.0, 0.25, 0.5, 0.75, 1.0]
### Response:
```swift
func rescaleToUnit(numbers: [Double]) -> [Double] {
    let min = numbers.min()!
    let max = numbers.max()!
    let range = max - min
    return numbers.map { (number) -> Double in
        return (number - min) / range
    }
}
```

func rescaleToUnit(numbers: [Double]) -> [Double] {
    let min = numbers.min()!
    let max = numbers.max()!
    let range = max - min
    return numbers.map { (number) -> Double in
        return (number - min) / range
    }
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Given array of numbers (of at least two elements), apply a linear transform to that array,
such that the smallest number will become 0 and the largest will become 1
rescaleToUnit(numbers: [1.0, 2.0, 3.0, 4.0, 5.0]) == [0.0, 0.25, 0.5, 0.75, 1.0]
### Response:
```swift
func rescaleToUnit(numbers: [Double]) -> [Double] {
    let min = numbers.min()!
    let max = numbers.max()!
    let range = max - min
    return numbers.map { (number) -> Double in
        return (number - min) / range
    }
}
```

func rescaleToUnit(numbers: [Double]) -> [Double] {
    let min = numbers.min()!
    let max = numbers.max()!
    return numbers.map { (number) -> Double in
        return (number - min) / (max - min)
    }
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Given array of numbers (of at least two elements), apply a linear transform to that array,
such that the smallest number will become 0 and the largest will become 1
rescaleToUnit(numbers: [1.0, 2.0, 3.0, 4.0, 5.0]) == [0.0, 0.25, 0.5, 0.75, 1.0]
### Response:
```swift
func rescaleToUnit(numbers: [Double]) -> [Double] {
    let min = numbers.min()!
    let max = numbers.max()!
    return numbers.map { (number) -> Double in
        return (number - min) / (max - min)
    }
}
```

func rescaleToUnit(numbers: [Double]) -> [Double] {
    let min = numbers.min()!
    let max = numbers.max()!
    return numbers.map { (number) -> Double in
        return (number - min) / (max - min)
    }
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Given array of numbers (of at least two elements), apply a linear transform to that array,
such that the smallest number will become 0 and the largest will become 1
rescaleToUnit(numbers: [1.0, 2.0, 3.0, 4.0, 5.0]) == [0.0, 0.25, 0.5, 0.75, 1.0]
### Response:
```swift
func rescaleToUnit(numbers: [Double]) -> [Double] {
    let min = numbers.min()!
    let max = numbers.max()!
    return numbers.map { (number) -> Double in
        return (number - min) / (max - min)
    }
}
```

func rescaleToUnit(numbers: [Double]) -> [Double] {
    let min = numbers.min()!
    let max = numbers.max()!
    let range = max - min
    return numbers.map { (number) -> Double in
        return (number - min) / range
    }
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Given array of numbers (of at least two elements), apply a linear transform to that array,
such that the smallest number will become 0 and the largest will become 1
rescaleToUnit(numbers: [1.0, 2.0, 3.0, 4.0, 5.0]) == [0.0, 0.25, 0.5, 0.75, 1.0]
### Response:
```swift
func rescaleToUnit(numbers: [Double]) -> [Double] {
    let min = numbers.min()!
    let max = numbers.max()!
    let range = max - min
    return numbers.map { (number) -> Double in
        return (number - min) / range
    }
}
```

func rescaleToUnit(numbers: [Double]) -> [Double] {
    let min = numbers.min()!
    let max = numbers.max()!
    return numbers.map { (number) -> Double in
        return (number - min) / (max - min)
    }
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Given array of numbers (of at least two elements), apply a linear transform to that array,
such that the smallest number will become 0 and the largest will become 1
rescaleToUnit(numbers: [1.0, 2.0, 3.0, 4.0, 5.0]) == [0.0, 0.25, 0.5, 0.75, 1.0]
### Response:
```swift
func rescaleToUnit(numbers: [Double]) -> [Double] {
    let min = numbers.min()!
    let max = numbers.max()!
    return numbers.map { (number) -> Double in
        return (number - min) / (max - min)
    }
}
```

func rescaleToUnit(numbers: [Double]) -> [Double] {
    let min = numbers.min()!
    let max = numbers.max()!
    return numbers.map { (number) -> Double in
        return (number - min) / (max - min)
    }
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Given array of numbers (of at least two elements), apply a linear transform to that array,
such that the smallest number will become 0 and the largest will become 1
rescaleToUnit(numbers: [1.0, 2.0, 3.0, 4.0, 5.0]) == [0.0, 0.25, 0.5, 0.75, 1.0]
### Response:
```swift
func rescaleToUnit(numbers: [Double]) -> [Double] {
    let min = numbers.min()!
    let max = numbers.max()!
    return numbers.map { (number) -> Double in
        return (number - min) / (max - min)
    }
}
```

func rescaleToUnit(numbers: [Double]) -> [Double] {
    let min = numbers.min()!
    let max = numbers.max()!
    return numbers.map { (number) -> Double in
        return (number - min) / (max - min)
    }
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Given array of numbers (of at least two elements), apply a linear transform to that array,
such that the smallest number will become 0 and the largest will become 1
rescaleToUnit(numbers: [1.0, 2.0, 3.0, 4.0, 5.0]) == [0.0, 0.25, 0.5, 0.75, 1.0]
### Response:
```swift
func rescaleToUnit(numbers: [Double]) -> [Double] {
    let min = numbers.min()!
    let max = numbers.max()!
    return numbers.map { (number) -> Double in
        return (number - min) / (max - min)
    }
}
```

func rescaleToUnit(numbers: [Double]) -> [Double] {
    let min = numbers.min()!
    let max = numbers.max()!
    return numbers.map { (number) -> Double in
        return (number - min) / (max - min)
    }
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Given array of numbers (of at least two elements), apply a linear transform to that array,
such that the smallest number will become 0 and the largest will become 1
rescaleToUnit(numbers: [1.0, 2.0, 3.0, 4.0, 5.0]) == [0.0, 0.25, 0.5, 0.75, 1.0]
### Response:
```swift
func rescaleToUnit(numbers: [Double]) -> [Double] {
    let min = numbers.min()!
    let max = numbers.max()!
    return numbers.map { (number) -> Double in
        return (number - min) / (max - min)
    }
}
```

func filterIntegers(values: [AnyHashable]) -> [Int] {
    return values.filter { $0 is Int }.map { $0 as! Int }
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Filter given array of any swiftthon values only for integers
filterIntegers(values: ["a", 3.14, 5]) == [5]
filterIntegers(values: [1, 2, 3, "abc", [:] as [AnyHashable : AnyHashable], [] as [AnyHashable]]) == [1, 2, 3]
### Response:
```swift
func filterIntegers(values: [AnyHashable]) -> [Int] {
    return values.filter { $0 is Int }.map { $0 as! Int }
}
```

func filterIntegers(values: [AnyHashable]) -> [Int] {
    return values.filter { $0 is Int }.map { $0 as! Int }
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Filter given array of any swiftthon values only for integers
filterIntegers(values: ["a", 3.14, 5]) == [5]
filterIntegers(values: [1, 2, 3, "abc", [:] as [AnyHashable : AnyHashable], [] as [AnyHashable]]) == [1, 2, 3]
### Response:
```swift
func filterIntegers(values: [AnyHashable]) -> [Int] {
    return values.filter { $0 is Int }.map { $0 as! Int }
}
```

func filterIntegers(values: [AnyHashable]) -> [Int] {
    return values.filter { $0 is Int }.map { $0 as! Int }
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Filter given array of any swiftthon values only for integers
filterIntegers(values: ["a", 3.14, 5]) == [5]
filterIntegers(values: [1, 2, 3, "abc", [:] as [AnyHashable : AnyHashable], [] as [AnyHashable]]) == [1, 2, 3]
### Response:
```swift
func filterIntegers(values: [AnyHashable]) -> [Int] {
    return values.filter { $0 is Int }.map { $0 as! Int }
}
```

func filterIntegers(values: [AnyHashable]) -> [Int] {
    return values.filter { $0 is Int }.map { $0 as! Int }
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Filter given array of any swiftthon values only for integers
filterIntegers(values: ["a", 3.14, 5]) == [5]
filterIntegers(values: [1, 2, 3, "abc", [:] as [AnyHashable : AnyHashable], [] as [AnyHashable]]) == [1, 2, 3]
### Response:
```swift
func filterIntegers(values: [AnyHashable]) -> [Int] {
    return values.filter { $0 is Int }.map { $0 as! Int }
}
```

func filterIntegers(values: [AnyHashable]) -> [Int] {
    return values.filter { $0 is Int }.map { $0 as! Int }
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Filter given array of any swiftthon values only for integers
filterIntegers(values: ["a", 3.14, 5]) == [5]
filterIntegers(values: [1, 2, 3, "abc", [:] as [AnyHashable : AnyHashable], [] as [AnyHashable]]) == [1, 2, 3]
### Response:
```swift
func filterIntegers(values: [AnyHashable]) -> [Int] {
    return values.filter { $0 is Int }.map { $0 as! Int }
}
```

func filterIntegers(values: [AnyHashable]) -> [Int] {
    return values.filter { $0 is Int }.map { $0 as! Int }
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Filter given array of any swiftthon values only for integers
filterIntegers(values: ["a", 3.14, 5]) == [5]
filterIntegers(values: [1, 2, 3, "abc", [:] as [AnyHashable : AnyHashable], [] as [AnyHashable]]) == [1, 2, 3]
### Response:
```swift
func filterIntegers(values: [AnyHashable]) -> [Int] {
    return values.filter { $0 is Int }.map { $0 as! Int }
}
```

func filterIntegers(values: [AnyHashable]) -> [Int] {
    return values.filter { $0 is Int }.map { $0 as! Int }
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Filter given array of any swiftthon values only for integers
filterIntegers(values: ["a", 3.14, 5]) == [5]
filterIntegers(values: [1, 2, 3, "abc", [:] as [AnyHashable : AnyHashable], [] as [AnyHashable]]) == [1, 2, 3]
### Response:
```swift
func filterIntegers(values: [AnyHashable]) -> [Int] {
    return values.filter { $0 is Int }.map { $0 as! Int }
}
```

func filterIntegers(values: [AnyHashable]) -> [Int] {
    return values.filter { $0 is Int }.map { $0 as! Int }
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Filter given array of any swiftthon values only for integers
filterIntegers(values: ["a", 3.14, 5]) == [5]
filterIntegers(values: [1, 2, 3, "abc", [:] as [AnyHashable : AnyHashable], [] as [AnyHashable]]) == [1, 2, 3]
### Response:
```swift
func filterIntegers(values: [AnyHashable]) -> [Int] {
    return values.filter { $0 is Int }.map { $0 as! Int }
}
```

func filterIntegers(values: [AnyHashable]) -> [Int] {
    return values.filter { $0 is Int }.map { $0 as! Int }
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Filter given array of any swiftthon values only for integers
filterIntegers(values: ["a", 3.14, 5]) == [5]
filterIntegers(values: [1, 2, 3, "abc", [:] as [AnyHashable : AnyHashable], [] as [AnyHashable]]) == [1, 2, 3]
### Response:
```swift
func filterIntegers(values: [AnyHashable]) -> [Int] {
    return values.filter { $0 is Int }.map { $0 as! Int }
}
```

func filterIntegers(values: [AnyHashable]) -> [Int] {
    return values.filter { $0 is Int }.map { $0 as! Int }
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Filter given array of any swiftthon values only for integers
filterIntegers(values: ["a", 3.14, 5]) == [5]
filterIntegers(values: [1, 2, 3, "abc", [:] as [AnyHashable : AnyHashable], [] as [AnyHashable]]) == [1, 2, 3]
### Response:
```swift
func filterIntegers(values: [AnyHashable]) -> [Int] {
    return values.filter { $0 is Int }.map { $0 as! Int }
}
```

func strlen(string: String) -> Int {
    return string.count
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Return length of given string
strlen(string: "") == 0
strlen(string: "abc") == 3
### Response:
```swift
func strlen(string: String) -> Int {
    return string.count
}
```

func strlen(string: String) -> Int {
    return string.count
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Return length of given string
strlen(string: "") == 0
strlen(string: "abc") == 3
### Response:
```swift
func strlen(string: String) -> Int {
    return string.count
}
```

func strlen(string: String) -> Int {
    return string.count
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Return length of given string
strlen(string: "") == 0
strlen(string: "abc") == 3
### Response:
```swift
func strlen(string: String) -> Int {
    return string.count
}
```

func strlen(string: String) -> Int {
    return string.count
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Return length of given string
strlen(string: "") == 0
strlen(string: "abc") == 3
### Response:
```swift
func strlen(string: String) -> Int {
    return string.count
}
```

func strlen(string: String) -> Int {
    return string.count
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Return length of given string
strlen(string: "") == 0
strlen(string: "abc") == 3
### Response:
```swift
func strlen(string: String) -> Int {
    return string.count
}
```

func strlen(string: String) -> Int {
    return string.count
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Return length of given string
strlen(string: "") == 0
strlen(string: "abc") == 3
### Response:
```swift
func strlen(string: String) -> Int {
    return string.count
}
```

func strlen(string: String) -> Int {
    return string.count
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Return length of given string
strlen(string: "") == 0
strlen(string: "abc") == 3
### Response:
```swift
func strlen(string: String) -> Int {
    return string.count
}
```

func strlen(string: String) -> Int {
    return string.count
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Return length of given string
strlen(string: "") == 0
strlen(string: "abc") == 3
### Response:
```swift
func strlen(string: String) -> Int {
    return string.count
}
```

func strlen(string: String) -> Int {
    return string.count
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Return length of given string
strlen(string: "") == 0
strlen(string: "abc") == 3
### Response:
```swift
func strlen(string: String) -> Int {
    return string.count
}
```

func strlen(string: String) -> Int {
    return string.count
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Return length of given string
strlen(string: "") == 0
strlen(string: "abc") == 3
### Response:
```swift
func strlen(string: String) -> Int {
    return string.count
}
```

func largestDivisor(n: Int) -> Int {
    return n.description.map { Int($0) ?? 0 }.reduce(0) { $0 * $1 }
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
For a given number n, find the largest number that divides n evenly, smaller than n
largestDivisor(n: 15) == 5
### Response:
```swift
func largestDivisor(n: Int) -> Int {
    return n.description.map { Int($0) ?? 0 }.reduce(0) { $0 * $1 }
}
```

func largestDivisor(n: Int) -> Int {
    return n.stride(to: 1, by: -1).first { n % $0 == 0 } ?? 1
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
For a given number n, find the largest number that divides n evenly, smaller than n
largestDivisor(n: 15) == 5
### Response:
```swift
func largestDivisor(n: Int) -> Int {
    return n.stride(to: 1, by: -1).first { n % $0 == 0 } ?? 1
}
```

func largestDivisor(n: Int) -> Int {
    var largestDivisor = 1
    for i in 2...n {
        if n % i == 0 {
            largestDivisor = i
        }
    }
    return largestDivisor
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
For a given number n, find the largest number that divides n evenly, smaller than n
largestDivisor(n: 15) == 5
### Response:
```swift
func largestDivisor(n: Int) -> Int {
    var largestDivisor = 1
    for i in 2...n {
        if n % i == 0 {
            largestDivisor = i
        }
    }
    return largestDivisor
}
```

func largestDivisor(n: Int) -> Int {
    var largestDivisor = 1
    for i in 2...n {
        if n % i == 0 {
            largestDivisor = i
        }
    }
    return largestDivisor
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
For a given number n, find the largest number that divides n evenly, smaller than n
largestDivisor(n: 15) == 5
### Response:
```swift
func largestDivisor(n: Int) -> Int {
    var largestDivisor = 1
    for i in 2...n {
        if n % i == 0 {
            largestDivisor = i
        }
    }
    return largestDivisor
}
```

func largestDivisor(n: Int) -> Int {
    var largestDivisor = 1
    for i in 2...n {
        if n % i == 0 {
            largestDivisor = i
        }
    }
    return largestDivisor
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
For a given number n, find the largest number that divides n evenly, smaller than n
largestDivisor(n: 15) == 5
### Response:
```swift
func largestDivisor(n: Int) -> Int {
    var largestDivisor = 1
    for i in 2...n {
        if n % i == 0 {
            largestDivisor = i
        }
    }
    return largestDivisor
}
```

func largestDivisor(n: Int) -> Int {
    var largestDivisor = 1
    for i in 2...n {
        if n % i == 0 {
            largestDivisor = i
        }
    }
    return largestDivisor
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
For a given number n, find the largest number that divides n evenly, smaller than n
largestDivisor(n: 15) == 5
### Response:
```swift
func largestDivisor(n: Int) -> Int {
    var largestDivisor = 1
    for i in 2...n {
        if n % i == 0 {
            largestDivisor = i
        }
    }
    return largestDivisor
}
```

func largestDivisor(n: Int) -> Int {
    var largestDivisor = 1
    for i in 2...n {
        if n % i == 0 {
            largestDivisor = i
        }
    }
    return largestDivisor
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
For a given number n, find the largest number that divides n evenly, smaller than n
largestDivisor(n: 15) == 5
### Response:
```swift
func largestDivisor(n: Int) -> Int {
    var largestDivisor = 1
    for i in 2...n {
        if n % i == 0 {
            largestDivisor = i
        }
    }
    return largestDivisor
}
```

func largestDivisor(n: Int) -> Int {
    var i = n
    while i > 1 {
        if n % i == 0 {
            return i
        }
        i -= 1
    }
    return 1
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
For a given number n, find the largest number that divides n evenly, smaller than n
largestDivisor(n: 15) == 5
### Response:
```swift
func largestDivisor(n: Int) -> Int {
    var i = n
    while i > 1 {
        if n % i == 0 {
            return i
        }
        i -= 1
    }
    return 1
}
```

func largestDivisor(n: Int) -> Int {
    var i = n
    while i > 1 {
        if n % i == 0 {
            return i
        }
        i -= 1
    }
    return 1
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
For a given number n, find the largest number that divides n evenly, smaller than n
largestDivisor(n: 15) == 5
### Response:
```swift
func largestDivisor(n: Int) -> Int {
    var i = n
    while i > 1 {
        if n % i == 0 {
            return i
        }
        i -= 1
    }
    return 1
}
```

func largestDivisor(n: Int) -> Int {
    var i = n
    while i > 1 {
        if n % i == 0 {
            return i
        }
        i -= 1
    }
    return 1
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
For a given number n, find the largest number that divides n evenly, smaller than n
largestDivisor(n: 15) == 5
### Response:
```swift
func largestDivisor(n: Int) -> Int {
    var i = n
    while i > 1 {
        if n % i == 0 {
            return i
        }
        i -= 1
    }
    return 1
}
```

func factorize(n: Int) -> [Int] {
    var factors = [Int]()
    var current = 2
    while n > 1 {
        if n % current == 0 {
            factors.append(current)
            n /= current
        } else {
            current += 1
        }
    }
    return factors
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Return array of prime factors of given integer in the order from smallest to largest.
Each of the factors should be arrayed number of times corresponding to how many times it appeares in factorization.
Input number should be equal to the product of all factors
factorize(n: 8) == [2, 2, 2]
factorize(n: 25) == [5, 5]
factorize(n: 70) == [2, 5, 7]
### Response:
```swift
func factorize(n: Int) -> [Int] {
    var factors = [Int]()
    var current = 2
    while n > 1 {
        if n % current == 0 {
            factors.append(current)
            n /= current
        } else {
            current += 1
        }
    }
    return factors
}
```

func factorize(n: Int) -> [Int] {
    var result = [Int]()
    var number = n
    var i = 2
    while number > 1 {
        if number % i == 0 {
            result.append(i)
            number /= i
        } else {
            i += 1
        }
    }
    return result
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Return array of prime factors of given integer in the order from smallest to largest.
Each of the factors should be arrayed number of times corresponding to how many times it appeares in factorization.
Input number should be equal to the product of all factors
factorize(n: 8) == [2, 2, 2]
factorize(n: 25) == [5, 5]
factorize(n: 70) == [2, 5, 7]
### Response:
```swift
func factorize(n: Int) -> [Int] {
    var result = [Int]()
    var number = n
    var i = 2
    while number > 1 {
        if number % i == 0 {
            result.append(i)
            number /= i
        } else {
            i += 1
        }
    }
    return result
}
```

func factorize(n: Int) -> [Int] {
    var result: [Int] = []
    var number = n
    var i = 2
    while number > 1 {
        if number % i == 0 {
            result.append(i)
            number /= i
        } else {
            i += 1
        }
    }
    return result
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Return array of prime factors of given integer in the order from smallest to largest.
Each of the factors should be arrayed number of times corresponding to how many times it appeares in factorization.
Input number should be equal to the product of all factors
factorize(n: 8) == [2, 2, 2]
factorize(n: 25) == [5, 5]
factorize(n: 70) == [2, 5, 7]
### Response:
```swift
func factorize(n: Int) -> [Int] {
    var result: [Int] = []
    var number = n
    var i = 2
    while number > 1 {
        if number % i == 0 {
            result.append(i)
            number /= i
        } else {
            i += 1
        }
    }
    return result
}
```

func factorize(n: Int) -> [Int] {
    var factors = [Int]()
    var number = n
    var i = 2
    while number > 1 {
        if number % i == 0 {
            factors.append(i)
            number /= i
        } else {
            i += 1
        }
    }
    return factors
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Return array of prime factors of given integer in the order from smallest to largest.
Each of the factors should be arrayed number of times corresponding to how many times it appeares in factorization.
Input number should be equal to the product of all factors
factorize(n: 8) == [2, 2, 2]
factorize(n: 25) == [5, 5]
factorize(n: 70) == [2, 5, 7]
### Response:
```swift
func factorize(n: Int) -> [Int] {
    var factors = [Int]()
    var number = n
    var i = 2
    while number > 1 {
        if number % i == 0 {
            factors.append(i)
            number /= i
        } else {
            i += 1
        }
    }
    return factors
}
```

func factorize(n: Int) -> [Int] {
    var factors = [Int]()
    var number = n
    var i = 2
    while number > 1 {
        if number % i == 0 {
            factors.append(i)
            number /= i
        } else {
            i += 1
        }
    }
    return factors
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Return array of prime factors of given integer in the order from smallest to largest.
Each of the factors should be arrayed number of times corresponding to how many times it appeares in factorization.
Input number should be equal to the product of all factors
factorize(n: 8) == [2, 2, 2]
factorize(n: 25) == [5, 5]
factorize(n: 70) == [2, 5, 7]
### Response:
```swift
func factorize(n: Int) -> [Int] {
    var factors = [Int]()
    var number = n
    var i = 2
    while number > 1 {
        if number % i == 0 {
            factors.append(i)
            number /= i
        } else {
            i += 1
        }
    }
    return factors
}
```

func factorize(n: Int) -> [Int] {
    var factors = [Int]()
    var number = n
    var i = 2
    while number > 1 {
        if number % i == 0 {
            factors.append(i)
            number /= i
        } else {
            i += 1
        }
    }
    return factors
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Return array of prime factors of given integer in the order from smallest to largest.
Each of the factors should be arrayed number of times corresponding to how many times it appeares in factorization.
Input number should be equal to the product of all factors
factorize(n: 8) == [2, 2, 2]
factorize(n: 25) == [5, 5]
factorize(n: 70) == [2, 5, 7]
### Response:
```swift
func factorize(n: Int) -> [Int] {
    var factors = [Int]()
    var number = n
    var i = 2
    while number > 1 {
        if number % i == 0 {
            factors.append(i)
            number /= i
        } else {
            i += 1
        }
    }
    return factors
}
```

func factorize(n: Int) -> [Int] {
    var result = [Int]()
    var number = n
    var i = 2
    while number > 1 {
        if number % i == 0 {
            result.append(i)
            number /= i
        } else {
            i += 1
        }
    }
    return result
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Return array of prime factors of given integer in the order from smallest to largest.
Each of the factors should be arrayed number of times corresponding to how many times it appeares in factorization.
Input number should be equal to the product of all factors
factorize(n: 8) == [2, 2, 2]
factorize(n: 25) == [5, 5]
factorize(n: 70) == [2, 5, 7]
### Response:
```swift
func factorize(n: Int) -> [Int] {
    var result = [Int]()
    var number = n
    var i = 2
    while number > 1 {
        if number % i == 0 {
            result.append(i)
            number /= i
        } else {
            i += 1
        }
    }
    return result
}
```

func factorize(n: Int) -> [Int] {
    var result = [Int]()
    var number = n
    var i = 2
    while number > 1 {
        if number % i == 0 {
            number /= i
            result.append(i)
        } else {
            i += 1
        }
    }
    return result
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Return array of prime factors of given integer in the order from smallest to largest.
Each of the factors should be arrayed number of times corresponding to how many times it appeares in factorization.
Input number should be equal to the product of all factors
factorize(n: 8) == [2, 2, 2]
factorize(n: 25) == [5, 5]
factorize(n: 70) == [2, 5, 7]
### Response:
```swift
func factorize(n: Int) -> [Int] {
    var result = [Int]()
    var number = n
    var i = 2
    while number > 1 {
        if number % i == 0 {
            number /= i
            result.append(i)
        } else {
            i += 1
        }
    }
    return result
}
```

func factorize(n: Int) -> [Int] {
    var factors = [Int]()
    var n = n
    var i = 2
    while n > 1 {
        if n % i == 0 {
            factors.append(i)
            n /= i
        } else {
            i += 1
        }
    }
    return factors
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Return array of prime factors of given integer in the order from smallest to largest.
Each of the factors should be arrayed number of times corresponding to how many times it appeares in factorization.
Input number should be equal to the product of all factors
factorize(n: 8) == [2, 2, 2]
factorize(n: 25) == [5, 5]
factorize(n: 70) == [2, 5, 7]
### Response:
```swift
func factorize(n: Int) -> [Int] {
    var factors = [Int]()
    var n = n
    var i = 2
    while n > 1 {
        if n % i == 0 {
            factors.append(i)
            n /= i
        } else {
            i += 1
        }
    }
    return factors
}
```

func factorize(n: Int) -> [Int] {
    var result = [Int]()
    var current = n
    var i = 2
    while i <= current {
        if current % i == 0 {
            current /= i
            result.append(i)
        } else {
            i += 1
        }
    }
    return result
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Return array of prime factors of given integer in the order from smallest to largest.
Each of the factors should be arrayed number of times corresponding to how many times it appeares in factorization.
Input number should be equal to the product of all factors
factorize(n: 8) == [2, 2, 2]
factorize(n: 25) == [5, 5]
factorize(n: 70) == [2, 5, 7]
### Response:
```swift
func factorize(n: Int) -> [Int] {
    var result = [Int]()
    var current = n
    var i = 2
    while i <= current {
        if current % i == 0 {
            current /= i
            result.append(i)
        } else {
            i += 1
        }
    }
    return result
}
```

func removeDuplicates(numbers: [Int]) -> [Int] {
    var result = [Int]()
    var set = Set<Int>()
    for number in numbers {
        if !set.contains(number) {
            set.insert(number)
            result.append(number)
        }
    }
    return result
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
From an array of integers, remove all elements that occur more than once.
Keep order of elements left the same as in the input.
removeDuplicates(numbers: [1, 2, 3, 2, 4]) == [1, 3, 4]
### Response:
```swift
func removeDuplicates(numbers: [Int]) -> [Int] {
    var result = [Int]()
    var set = Set<Int>()
    for number in numbers {
        if !set.contains(number) {
            set.insert(number)
            result.append(number)
        }
    }
    return result
}
```

func removeDuplicates(numbers: [Int]) -> [Int] {
    var result = [Int]()
    var unique = Set<Int>()
    for number in numbers {
        if !unique.contains(number) {
            unique.insert(number)
            result.append(number)
        }
    }
    return result
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
From an array of integers, remove all elements that occur more than once.
Keep order of elements left the same as in the input.
removeDuplicates(numbers: [1, 2, 3, 2, 4]) == [1, 3, 4]
### Response:
```swift
func removeDuplicates(numbers: [Int]) -> [Int] {
    var result = [Int]()
    var unique = Set<Int>()
    for number in numbers {
        if !unique.contains(number) {
            unique.insert(number)
            result.append(number)
        }
    }
    return result
}
```

func removeDuplicates(numbers: [Int]) -> [Int] {
    var result = [Int]()
    var set = Set<Int>()
    for number in numbers {
        if !set.contains(number) {
            set.insert(number)
            result.append(number)
        }
    }
    return result
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
From an array of integers, remove all elements that occur more than once.
Keep order of elements left the same as in the input.
removeDuplicates(numbers: [1, 2, 3, 2, 4]) == [1, 3, 4]
### Response:
```swift
func removeDuplicates(numbers: [Int]) -> [Int] {
    var result = [Int]()
    var set = Set<Int>()
    for number in numbers {
        if !set.contains(number) {
            set.insert(number)
            result.append(number)
        }
    }
    return result
}
```

func removeDuplicates(numbers: [Int]) -> [Int] {
    var result = [Int]()
    var unique = Set<Int>()
    for number in numbers {
        if !unique.contains(number) {
            unique.insert(number)
            result.append(number)
        }
    }
    return result
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
From an array of integers, remove all elements that occur more than once.
Keep order of elements left the same as in the input.
removeDuplicates(numbers: [1, 2, 3, 2, 4]) == [1, 3, 4]
### Response:
```swift
func removeDuplicates(numbers: [Int]) -> [Int] {
    var result = [Int]()
    var unique = Set<Int>()
    for number in numbers {
        if !unique.contains(number) {
            unique.insert(number)
            result.append(number)
        }
    }
    return result
}
```

func removeDuplicates(numbers: [Int]) -> [Int] {
    var result = [Int]()
    var set = Set<Int>()
    for number in numbers {
        if !set.contains(number) {
            result.append(number)
            set.insert(number)
        }
    }
    return result
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
From an array of integers, remove all elements that occur more than once.
Keep order of elements left the same as in the input.
removeDuplicates(numbers: [1, 2, 3, 2, 4]) == [1, 3, 4]
### Response:
```swift
func removeDuplicates(numbers: [Int]) -> [Int] {
    var result = [Int]()
    var set = Set<Int>()
    for number in numbers {
        if !set.contains(number) {
            result.append(number)
            set.insert(number)
        }
    }
    return result
}
```

func removeDuplicates(numbers: [Int]) -> [Int] {
    var result = [Int]()
    for number in numbers {
        if !result.contains(number) {
            result.append(number)
        }
    }
    return result
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
From an array of integers, remove all elements that occur more than once.
Keep order of elements left the same as in the input.
removeDuplicates(numbers: [1, 2, 3, 2, 4]) == [1, 3, 4]
### Response:
```swift
func removeDuplicates(numbers: [Int]) -> [Int] {
    var result = [Int]()
    for number in numbers {
        if !result.contains(number) {
            result.append(number)
        }
    }
    return result
}
```

func removeDuplicates(numbers: [Int]) -> [Int] {
    var result = [Int]()
    var set = Set<Int>()
    for number in numbers {
        if !set.contains(number) {
            set.insert(number)
            result.append(number)
        }
    }
    return result
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
From an array of integers, remove all elements that occur more than once.
Keep order of elements left the same as in the input.
removeDuplicates(numbers: [1, 2, 3, 2, 4]) == [1, 3, 4]
### Response:
```swift
func removeDuplicates(numbers: [Int]) -> [Int] {
    var result = [Int]()
    var set = Set<Int>()
    for number in numbers {
        if !set.contains(number) {
            set.insert(number)
            result.append(number)
        }
    }
    return result
}
```

func removeDuplicates(numbers: [Int]) -> [Int] {
    var result = [Int]()
    for number in numbers {
        if !result.contains(number) {
            result.append(number)
        }
    }
    return result
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
From an array of integers, remove all elements that occur more than once.
Keep order of elements left the same as in the input.
removeDuplicates(numbers: [1, 2, 3, 2, 4]) == [1, 3, 4]
### Response:
```swift
func removeDuplicates(numbers: [Int]) -> [Int] {
    var result = [Int]()
    for number in numbers {
        if !result.contains(number) {
            result.append(number)
        }
    }
    return result
}
```

func removeDuplicates(numbers: [Int]) -> [Int] {
    var result = [Int]()
    var set = Set<Int>()
    for number in numbers {
        if !set.contains(number) {
            result.append(number)
            set.insert(number)
        }
    }
    return result
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
From an array of integers, remove all elements that occur more than once.
Keep order of elements left the same as in the input.
removeDuplicates(numbers: [1, 2, 3, 2, 4]) == [1, 3, 4]
### Response:
```swift
func removeDuplicates(numbers: [Int]) -> [Int] {
    var result = [Int]()
    var set = Set<Int>()
    for number in numbers {
        if !set.contains(number) {
            result.append(number)
            set.insert(number)
        }
    }
    return result
}
```

func removeDuplicates(numbers: [Int]) -> [Int] {
    var result = [Int]()
    for number in numbers {
        if !result.contains(number) {
            result.append(number)
        }
    }
    return result
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
From an array of integers, remove all elements that occur more than once.
Keep order of elements left the same as in the input.
removeDuplicates(numbers: [1, 2, 3, 2, 4]) == [1, 3, 4]
### Response:
```swift
func removeDuplicates(numbers: [Int]) -> [Int] {
    var result = [Int]()
    for number in numbers {
        if !result.contains(number) {
            result.append(number)
        }
    }
    return result
}
```

func flipCase(string: String) -> String {
    return string.map {
        if $0.isUppercase {
            return String($0).lowercased().first!
        } else {
            return String($0).uppercased().first!
        }
    }.joined()
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
For a given string, flip lowercase characters to uppercase and uppercase to lowercase.
flipCase(string: "Hello") == "hELLO"
### Response:
```swift
func flipCase(string: String) -> String {
    return string.map {
        if $0.isUppercase {
            return String($0).lowercased().first!
        } else {
            return String($0).uppercased().first!
        }
    }.joined()
}
```

func flipCase(string: String) -> String {
    return string.map {
        $0 == $0.uppercased() ? $0.lowercased() : $0.uppercased()
    }.joined()
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
For a given string, flip lowercase characters to uppercase and uppercase to lowercase.
flipCase(string: "Hello") == "hELLO"
### Response:
```swift
func flipCase(string: String) -> String {
    return string.map {
        $0 == $0.uppercased() ? $0.lowercased() : $0.uppercased()
    }.joined()
}
```

func flipCase(string: String) -> String {
    return string.map {
        if $0.isUppercase {
            return String($0).lowercased().first!
        } else {
            return String($0).uppercased().first!
        }
    }.joined()
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
For a given string, flip lowercase characters to uppercase and uppercase to lowercase.
flipCase(string: "Hello") == "hELLO"
### Response:
```swift
func flipCase(string: String) -> String {
    return string.map {
        if $0.isUppercase {
            return String($0).lowercased().first!
        } else {
            return String($0).uppercased().first!
        }
    }.joined()
}
```

func flipCase(string: String) -> String {
    return string.map {
        $0 == $0.uppercased() ? $0.lowercased() : $0.uppercased()
    }.joined()
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
For a given string, flip lowercase characters to uppercase and uppercase to lowercase.
flipCase(string: "Hello") == "hELLO"
### Response:
```swift
func flipCase(string: String) -> String {
    return string.map {
        $0 == $0.uppercased() ? $0.lowercased() : $0.uppercased()
    }.joined()
}
```

func flipCase(string: String) -> String {
    var result = ""
    for char in string {
        if char.isUppercase {
            result += char.lowercased()
        } else {
            result += char.uppercased()
        }
    }
    return result
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
For a given string, flip lowercase characters to uppercase and uppercase to lowercase.
flipCase(string: "Hello") == "hELLO"
### Response:
```swift
func flipCase(string: String) -> String {
    var result = ""
    for char in string {
        if char.isUppercase {
            result += char.lowercased()
        } else {
            result += char.uppercased()
        }
    }
    return result
}
```

func flipCase(string: String) -> String {
    return string.map {
        if $0.isUppercase {
            return String($0).lowercased().first!
        } else {
            return String($0).uppercased().first!
        }
    }.joined()
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
For a given string, flip lowercase characters to uppercase and uppercase to lowercase.
flipCase(string: "Hello") == "hELLO"
### Response:
```swift
func flipCase(string: String) -> String {
    return string.map {
        if $0.isUppercase {
            return String($0).lowercased().first!
        } else {
            return String($0).uppercased().first!
        }
    }.joined()
}
```

func flipCase(string: String) -> String {
    return string.map { $0 == $0.uppercased() ? $0.lowercased() : $0.uppercased() }.joined()
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
For a given string, flip lowercase characters to uppercase and uppercase to lowercase.
flipCase(string: "Hello") == "hELLO"
### Response:
```swift
func flipCase(string: String) -> String {
    return string.map { $0 == $0.uppercased() ? $0.lowercased() : $0.uppercased() }.joined()
}
```

func flipCase(string: String) -> String {
    return string.map { $0.isUppercase ? $0.lowercased() : $0.uppercased() }.joined()
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
For a given string, flip lowercase characters to uppercase and uppercase to lowercase.
flipCase(string: "Hello") == "hELLO"
### Response:
```swift
func flipCase(string: String) -> String {
    return string.map { $0.isUppercase ? $0.lowercased() : $0.uppercased() }.joined()
}
```

func flipCase(string: String) -> String {
    return string.map { $0.isUppercase ? $0.lowercased() : $0.uppercased() }.joined()
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
For a given string, flip lowercase characters to uppercase and uppercase to lowercase.
flipCase(string: "Hello") == "hELLO"
### Response:
```swift
func flipCase(string: String) -> String {
    return string.map { $0.isUppercase ? $0.lowercased() : $0.uppercased() }.joined()
}
```

func flipCase(string: String) -> String {
    return string.map {
        if $0.isUppercase {
            return String($0.lowercased())
        } else {
            return String($0.uppercased())
        }
    }.joined()
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
For a given string, flip lowercase characters to uppercase and uppercase to lowercase.
flipCase(string: "Hello") == "hELLO"
### Response:
```swift
func flipCase(string: String) -> String {
    return string.map {
        if $0.isUppercase {
            return String($0.lowercased())
        } else {
            return String($0.uppercased())
        }
    }.joined()
}
```

func concatenate(strings: [String]) -> String {
    return strings.joined(separator: "")
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Concatenate array of strings into a single string
concatenate(strings: [] as [String]) == ""
concatenate(strings: ["a", "b", "c"]) == "abc"
### Response:
```swift
func concatenate(strings: [String]) -> String {
    return strings.joined(separator: "")
}
```

func concatenate(strings: [String]) -> String {
    return strings.joined()
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Concatenate array of strings into a single string
concatenate(strings: [] as [String]) == ""
concatenate(strings: ["a", "b", "c"]) == "abc"
### Response:
```swift
func concatenate(strings: [String]) -> String {
    return strings.joined()
}
```

func concatenate(strings: [String]) -> String {
    return strings.joined()
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Concatenate array of strings into a single string
concatenate(strings: [] as [String]) == ""
concatenate(strings: ["a", "b", "c"]) == "abc"
### Response:
```swift
func concatenate(strings: [String]) -> String {
    return strings.joined()
}
```

func concatenate(strings: [String]) -> String {
    return strings.joined()
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Concatenate array of strings into a single string
concatenate(strings: [] as [String]) == ""
concatenate(strings: ["a", "b", "c"]) == "abc"
### Response:
```swift
func concatenate(strings: [String]) -> String {
    return strings.joined()
}
```

func concatenate(strings: [String]) -> String {
    return strings.joined(separator: "")
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Concatenate array of strings into a single string
concatenate(strings: [] as [String]) == ""
concatenate(strings: ["a", "b", "c"]) == "abc"
### Response:
```swift
func concatenate(strings: [String]) -> String {
    return strings.joined(separator: "")
}
```

func concatenate(strings: [String]) -> String {
    return strings.joined()
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Concatenate array of strings into a single string
concatenate(strings: [] as [String]) == ""
concatenate(strings: ["a", "b", "c"]) == "abc"
### Response:
```swift
func concatenate(strings: [String]) -> String {
    return strings.joined()
}
```

func concatenate(strings: [String]) -> String {
    return strings.joined()
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Concatenate array of strings into a single string
concatenate(strings: [] as [String]) == ""
concatenate(strings: ["a", "b", "c"]) == "abc"
### Response:
```swift
func concatenate(strings: [String]) -> String {
    return strings.joined()
}
```

func concatenate(strings: [String]) -> String {
    return strings.joined()
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Concatenate array of strings into a single string
concatenate(strings: [] as [String]) == ""
concatenate(strings: ["a", "b", "c"]) == "abc"
### Response:
```swift
func concatenate(strings: [String]) -> String {
    return strings.joined()
}
```

func concatenate(strings: [String]) -> String {
    return strings.joined(separator: "")
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Concatenate array of strings into a single string
concatenate(strings: [] as [String]) == ""
concatenate(strings: ["a", "b", "c"]) == "abc"
### Response:
```swift
func concatenate(strings: [String]) -> String {
    return strings.joined(separator: "")
}
```

func concatenate(strings: [String]) -> String {
    return strings.joined()
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Concatenate array of strings into a single string
concatenate(strings: [] as [String]) == ""
concatenate(strings: ["a", "b", "c"]) == "abc"
### Response:
```swift
func concatenate(strings: [String]) -> String {
    return strings.joined()
}
```

func filterByPrefix(strings: [String], prefix: String) -> [String] {
    return strings.filter { $0.hasPrefix(prefix) }
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Filter an input array of strings only for ones that start with a given prefix.
filterByPrefix(strings: [] as [String], prefix: "a") == [] as [String]
filterByPrefix(strings: ["abc", "bcd", "cde", "array"], prefix: "a") == ["abc", "array"]
### Response:
```swift
func filterByPrefix(strings: [String], prefix: String) -> [String] {
    return strings.filter { $0.hasPrefix(prefix) }
}
```

func filterByPrefix(strings: [String], prefix: String) -> [String] {
    return strings.filter { $0.hasPrefix(prefix) }
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Filter an input array of strings only for ones that start with a given prefix.
filterByPrefix(strings: [] as [String], prefix: "a") == [] as [String]
filterByPrefix(strings: ["abc", "bcd", "cde", "array"], prefix: "a") == ["abc", "array"]
### Response:
```swift
func filterByPrefix(strings: [String], prefix: String) -> [String] {
    return strings.filter { $0.hasPrefix(prefix) }
}
```

func filterByPrefix(strings: [String], prefix: String) -> [String] {
    return strings.filter { $0.hasPrefix(prefix) }
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Filter an input array of strings only for ones that start with a given prefix.
filterByPrefix(strings: [] as [String], prefix: "a") == [] as [String]
filterByPrefix(strings: ["abc", "bcd", "cde", "array"], prefix: "a") == ["abc", "array"]
### Response:
```swift
func filterByPrefix(strings: [String], prefix: String) -> [String] {
    return strings.filter { $0.hasPrefix(prefix) }
}
```

func filterByPrefix(strings: [String], prefix: String) -> [String] {
    return strings.filter { $0.hasPrefix(prefix) }
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Filter an input array of strings only for ones that start with a given prefix.
filterByPrefix(strings: [] as [String], prefix: "a") == [] as [String]
filterByPrefix(strings: ["abc", "bcd", "cde", "array"], prefix: "a") == ["abc", "array"]
### Response:
```swift
func filterByPrefix(strings: [String], prefix: String) -> [String] {
    return strings.filter { $0.hasPrefix(prefix) }
}
```

func filterByPrefix(strings: [String], prefix: String) -> [String] {
    return strings.filter { $0.hasPrefix(prefix) }
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Filter an input array of strings only for ones that start with a given prefix.
filterByPrefix(strings: [] as [String], prefix: "a") == [] as [String]
filterByPrefix(strings: ["abc", "bcd", "cde", "array"], prefix: "a") == ["abc", "array"]
### Response:
```swift
func filterByPrefix(strings: [String], prefix: String) -> [String] {
    return strings.filter { $0.hasPrefix(prefix) }
}
```

func filterByPrefix(strings: [String], prefix: String) -> [String] {
    return strings.filter { $0.hasPrefix(prefix) }
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Filter an input array of strings only for ones that start with a given prefix.
filterByPrefix(strings: [] as [String], prefix: "a") == [] as [String]
filterByPrefix(strings: ["abc", "bcd", "cde", "array"], prefix: "a") == ["abc", "array"]
### Response:
```swift
func filterByPrefix(strings: [String], prefix: String) -> [String] {
    return strings.filter { $0.hasPrefix(prefix) }
}
```

func filterByPrefix(strings: [String], prefix: String) -> [String] {
    return strings.filter { $0.hasPrefix(prefix) }
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Filter an input array of strings only for ones that start with a given prefix.
filterByPrefix(strings: [] as [String], prefix: "a") == [] as [String]
filterByPrefix(strings: ["abc", "bcd", "cde", "array"], prefix: "a") == ["abc", "array"]
### Response:
```swift
func filterByPrefix(strings: [String], prefix: String) -> [String] {
    return strings.filter { $0.hasPrefix(prefix) }
}
```

func filterByPrefix(strings: [String], prefix: String) -> [String] {
    return strings.filter { $0.hasPrefix(prefix) }
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Filter an input array of strings only for ones that start with a given prefix.
filterByPrefix(strings: [] as [String], prefix: "a") == [] as [String]
filterByPrefix(strings: ["abc", "bcd", "cde", "array"], prefix: "a") == ["abc", "array"]
### Response:
```swift
func filterByPrefix(strings: [String], prefix: String) -> [String] {
    return strings.filter { $0.hasPrefix(prefix) }
}
```

func filterByPrefix(strings: [String], prefix: String) -> [String] {
    return strings.filter { $0.hasPrefix(prefix) }
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Filter an input array of strings only for ones that start with a given prefix.
filterByPrefix(strings: [] as [String], prefix: "a") == [] as [String]
filterByPrefix(strings: ["abc", "bcd", "cde", "array"], prefix: "a") == ["abc", "array"]
### Response:
```swift
func filterByPrefix(strings: [String], prefix: String) -> [String] {
    return strings.filter { $0.hasPrefix(prefix) }
}
```

func filterByPrefix(strings: [String], prefix: String) -> [String] {
    return strings.filter { $0.hasPrefix(prefix) }
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Filter an input array of strings only for ones that start with a given prefix.
filterByPrefix(strings: [] as [String], prefix: "a") == [] as [String]
filterByPrefix(strings: ["abc", "bcd", "cde", "array"], prefix: "a") == ["abc", "array"]
### Response:
```swift
func filterByPrefix(strings: [String], prefix: String) -> [String] {
    return strings.filter { $0.hasPrefix(prefix) }
}
```

func getPositive(l: [Int]) -> [Int] {
    return l.filter { $0 > 0 }
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Return only positive numbers in the array.
getPositive(l: [-1, 2, -4, 5, 6]) == [2, 5, 6]
getPositive(l: [5, 3, -5, 2, -3, 3, 9, 0, 123, 1, -10]) == [5, 3, 2, 3, 9, 123, 1]
### Response:
```swift
func getPositive(l: [Int]) -> [Int] {
    return l.filter { $0 > 0 }
}
```

func getPositive(l: [Int]) -> [Int] {
    return l.filter { $0 > 0 }
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Return only positive numbers in the array.
getPositive(l: [-1, 2, -4, 5, 6]) == [2, 5, 6]
getPositive(l: [5, 3, -5, 2, -3, 3, 9, 0, 123, 1, -10]) == [5, 3, 2, 3, 9, 123, 1]
### Response:
```swift
func getPositive(l: [Int]) -> [Int] {
    return l.filter { $0 > 0 }
}
```

func getPositive(l: [Int]) -> [Int] {
    return l.filter { $0 > 0 }
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Return only positive numbers in the array.
getPositive(l: [-1, 2, -4, 5, 6]) == [2, 5, 6]
getPositive(l: [5, 3, -5, 2, -3, 3, 9, 0, 123, 1, -10]) == [5, 3, 2, 3, 9, 123, 1]
### Response:
```swift
func getPositive(l: [Int]) -> [Int] {
    return l.filter { $0 > 0 }
}
```

func getPositive(l: [Int]) -> [Int] {
    return l.filter { $0 > 0 }
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Return only positive numbers in the array.
getPositive(l: [-1, 2, -4, 5, 6]) == [2, 5, 6]
getPositive(l: [5, 3, -5, 2, -3, 3, 9, 0, 123, 1, -10]) == [5, 3, 2, 3, 9, 123, 1]
### Response:
```swift
func getPositive(l: [Int]) -> [Int] {
    return l.filter { $0 > 0 }
}
```

func getPositive(l: [Int]) -> [Int] {
    return l.filter { $0 > 0 }
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Return only positive numbers in the array.
getPositive(l: [-1, 2, -4, 5, 6]) == [2, 5, 6]
getPositive(l: [5, 3, -5, 2, -3, 3, 9, 0, 123, 1, -10]) == [5, 3, 2, 3, 9, 123, 1]
### Response:
```swift
func getPositive(l: [Int]) -> [Int] {
    return l.filter { $0 > 0 }
}
```

func getPositive(l: [Int]) -> [Int] {
    return l.filter { $0 > 0 }
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Return only positive numbers in the array.
getPositive(l: [-1, 2, -4, 5, 6]) == [2, 5, 6]
getPositive(l: [5, 3, -5, 2, -3, 3, 9, 0, 123, 1, -10]) == [5, 3, 2, 3, 9, 123, 1]
### Response:
```swift
func getPositive(l: [Int]) -> [Int] {
    return l.filter { $0 > 0 }
}
```

func getPositive(l: [Int]) -> [Int] {
    return l.filter { $0 > 0 }
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Return only positive numbers in the array.
getPositive(l: [-1, 2, -4, 5, 6]) == [2, 5, 6]
getPositive(l: [5, 3, -5, 2, -3, 3, 9, 0, 123, 1, -10]) == [5, 3, 2, 3, 9, 123, 1]
### Response:
```swift
func getPositive(l: [Int]) -> [Int] {
    return l.filter { $0 > 0 }
}
```

func getPositive(l: [Int]) -> [Int] {
    return l.filter { $0 > 0 }
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Return only positive numbers in the array.
getPositive(l: [-1, 2, -4, 5, 6]) == [2, 5, 6]
getPositive(l: [5, 3, -5, 2, -3, 3, 9, 0, 123, 1, -10]) == [5, 3, 2, 3, 9, 123, 1]
### Response:
```swift
func getPositive(l: [Int]) -> [Int] {
    return l.filter { $0 > 0 }
}
```

func getPositive(l: [Int]) -> [Int] {
    return l.filter { $0 > 0 }
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Return only positive numbers in the array.
getPositive(l: [-1, 2, -4, 5, 6]) == [2, 5, 6]
getPositive(l: [5, 3, -5, 2, -3, 3, 9, 0, 123, 1, -10]) == [5, 3, 2, 3, 9, 123, 1]
### Response:
```swift
func getPositive(l: [Int]) -> [Int] {
    return l.filter { $0 > 0 }
}
```

func getPositive(l: [Int]) -> [Int] {
    return l.filter { $0 > 0 }
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Return only positive numbers in the array.
getPositive(l: [-1, 2, -4, 5, 6]) == [2, 5, 6]
getPositive(l: [5, 3, -5, 2, -3, 3, 9, 0, 123, 1, -10]) == [5, 3, 2, 3, 9, 123, 1]
### Response:
```swift
func getPositive(l: [Int]) -> [Int] {
    return l.filter { $0 > 0 }
}
```

func isPrime(n: Int) -> Bool {
    if n <= 1 {
        return false
    }
    var i = 2
    while i <= n / 2 {
        if n % i == 0 {
            return false
        }
        i += 1
    }
    return true
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Return true if a given number is prime, and false otherwise.
isPrime(n: 6) == false
isPrime(n: 101) == true
isPrime(n: 11) == true
isPrime(n: 13441) == true
isPrime(n: 61) == true
isPrime(n: 4) == false
isPrime(n: 1) == false
### Response:
```swift
func isPrime(n: Int) -> Bool {
    if n <= 1 {
        return false
    }
    var i = 2
    while i <= n / 2 {
        if n % i == 0 {
            return false
        }
        i += 1
    }
    return true
}
```

func isPrime(n: Int) -> Bool {
    if n <= 1 {
        return false
    }
    var i = 2
    while i <= n / i {
        if n % i == 0 {
            return false
        }
        i += 1
    }
    return true
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Return true if a given number is prime, and false otherwise.
isPrime(n: 6) == false
isPrime(n: 101) == true
isPrime(n: 11) == true
isPrime(n: 13441) == true
isPrime(n: 61) == true
isPrime(n: 4) == false
isPrime(n: 1) == false
### Response:
```swift
func isPrime(n: Int) -> Bool {
    if n <= 1 {
        return false
    }
    var i = 2
    while i <= n / i {
        if n % i == 0 {
            return false
        }
        i += 1
    }
    return true
}
```

func isPrime(n: Int) -> Bool {
    if n < 2 {
        return false
    }
    for i in 2..<n {
        if n % i == 0 {
            return false
        }
    }
    return true
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Return true if a given number is prime, and false otherwise.
isPrime(n: 6) == false
isPrime(n: 101) == true
isPrime(n: 11) == true
isPrime(n: 13441) == true
isPrime(n: 61) == true
isPrime(n: 4) == false
isPrime(n: 1) == false
### Response:
```swift
func isPrime(n: Int) -> Bool {
    if n < 2 {
        return false
    }
    for i in 2..<n {
        if n % i == 0 {
            return false
        }
    }
    return true
}
```

func isPrime(n: Int) -> Bool {
    if n < 2 {
        return false
    }
    if n == 2 {
        return true
    }
    if n % 2 == 0 {
        return false
    }
    var i = 3
    while i * i <= n {
        if n % i == 0 {
            return false
        }
        i += 2
    }
    return true
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Return true if a given number is prime, and false otherwise.
isPrime(n: 6) == false
isPrime(n: 101) == true
isPrime(n: 11) == true
isPrime(n: 13441) == true
isPrime(n: 61) == true
isPrime(n: 4) == false
isPrime(n: 1) == false
### Response:
```swift
func isPrime(n: Int) -> Bool {
    if n < 2 {
        return false
    }
    if n == 2 {
        return true
    }
    if n % 2 == 0 {
        return false
    }
    var i = 3
    while i * i <= n {
        if n % i == 0 {
            return false
        }
        i += 2
    }
    return true
}
```

func isPrime(n: Int) -> Bool {
    if n <= 1 {
        return false
    }
    for i in 2..<n {
        if n % i == 0 {
            return false
        }
    }
    return true
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Return true if a given number is prime, and false otherwise.
isPrime(n: 6) == false
isPrime(n: 101) == true
isPrime(n: 11) == true
isPrime(n: 13441) == true
isPrime(n: 61) == true
isPrime(n: 4) == false
isPrime(n: 1) == false
### Response:
```swift
func isPrime(n: Int) -> Bool {
    if n <= 1 {
        return false
    }
    for i in 2..<n {
        if n % i == 0 {
            return false
        }
    }
    return true
}
```

func isPrime(n: Int) -> Bool {
    guard n > 1 else { return false }
    guard n != 2 else { return true }
    guard n % 2 != 0 else { return false }
    var i = 3
    while i * i <= n {
        guard n % i != 0 else { return false }
        i += 2
    }
    return true
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Return true if a given number is prime, and false otherwise.
isPrime(n: 6) == false
isPrime(n: 101) == true
isPrime(n: 11) == true
isPrime(n: 13441) == true
isPrime(n: 61) == true
isPrime(n: 4) == false
isPrime(n: 1) == false
### Response:
```swift
func isPrime(n: Int) -> Bool {
    guard n > 1 else { return false }
    guard n != 2 else { return true }
    guard n % 2 != 0 else { return false }
    var i = 3
    while i * i <= n {
        guard n % i != 0 else { return false }
        i += 2
    }
    return true
}
```

func isPrime(n: Int) -> Bool {
    if n <= 1 {
        return false
    }
    for i in 2..<n {
        if n % i == 0 {
            return false
        }
    }
    return true
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Return true if a given number is prime, and false otherwise.
isPrime(n: 6) == false
isPrime(n: 101) == true
isPrime(n: 11) == true
isPrime(n: 13441) == true
isPrime(n: 61) == true
isPrime(n: 4) == false
isPrime(n: 1) == false
### Response:
```swift
func isPrime(n: Int) -> Bool {
    if n <= 1 {
        return false
    }
    for i in 2..<n {
        if n % i == 0 {
            return false
        }
    }
    return true
}
```

func isPrime(n: Int) -> Bool {
    if n < 2 {
        return false
    }
    var i = 2
    while i <= n / i {
        if n % i == 0 {
            return false
        }
        i += 1
    }
    return true
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Return true if a given number is prime, and false otherwise.
isPrime(n: 6) == false
isPrime(n: 101) == true
isPrime(n: 11) == true
isPrime(n: 13441) == true
isPrime(n: 61) == true
isPrime(n: 4) == false
isPrime(n: 1) == false
### Response:
```swift
func isPrime(n: Int) -> Bool {
    if n < 2 {
        return false
    }
    var i = 2
    while i <= n / i {
        if n % i == 0 {
            return false
        }
        i += 1
    }
    return true
}
```

func isPrime(n: Int) -> Bool {
    if n < 2 {
        return false
    }
    var i = 2
    while i <= n / i {
        if n % i == 0 {
            return false
        }
        i += 1
    }
    return true
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Return true if a given number is prime, and false otherwise.
isPrime(n: 6) == false
isPrime(n: 101) == true
isPrime(n: 11) == true
isPrime(n: 13441) == true
isPrime(n: 61) == true
isPrime(n: 4) == false
isPrime(n: 1) == false
### Response:
```swift
func isPrime(n: Int) -> Bool {
    if n < 2 {
        return false
    }
    var i = 2
    while i <= n / i {
        if n % i == 0 {
            return false
        }
        i += 1
    }
    return true
}
```

func isPrime(n: Int) -> Bool {
    if n <= 1 {
        return false
    }
    if n <= 3 {
        return true
    }
    if n % 2 == 0 || n % 3 == 0 {
        return false
    }
    var i = 5
    while i * i <= n {
        if n % i == 0 || n % (i + 2) == 0 {
            return false
        }
        i += 6
    }
    return true
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Return true if a given number is prime, and false otherwise.
isPrime(n: 6) == false
isPrime(n: 101) == true
isPrime(n: 11) == true
isPrime(n: 13441) == true
isPrime(n: 61) == true
isPrime(n: 4) == false
isPrime(n: 1) == false
### Response:
```swift
func isPrime(n: Int) -> Bool {
    if n <= 1 {
        return false
    }
    if n <= 3 {
        return true
    }
    if n % 2 == 0 || n % 3 == 0 {
        return false
    }
    var i = 5
    while i * i <= n {
        if n % i == 0 || n % (i + 2) == 0 {
            return false
        }
        i += 6
    }
    return true
}
```

func sortThird(l: [Int]) -> [Int] {
    var result = l
    for i in 0..<l.count {
        if i % 3 == 0 {
            result[i] = l[i]
        }
    }
    for i in 0..<l.count {
        if i % 3 == 1 {
            result[i] = l[i]
        }
    }
    for i in 0..<l.count {
        if i % 3 == 2 {
            result[i] = l[i]
        }
    }
    return result
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
This function takes an array l and returns an array l' such that
l' is identical to l in the indicies that are not divisible by three, while its values at the indicies that are divisible by three are equal
to the values of the corresponding indicies of l, but sorted.
sortThird(l: [1, 2, 3]) == [1, 2, 3]
sortThird(l: [5, 6, 3, 4, 8, 9, 2]) == [2, 6, 3, 4, 8, 9, 5]
### Response:
```swift
func sortThird(l: [Int]) -> [Int] {
    var result = l
    for i in 0..<l.count {
        if i % 3 == 0 {
            result[i] = l[i]
        }
    }
    for i in 0..<l.count {
        if i % 3 == 1 {
            result[i] = l[i]
        }
    }
    for i in 0..<l.count {
        if i % 3 == 2 {
            result[i] = l[i]
        }
    }
    return result
}
```

func sortThird(l: [Int]) -> [Int] {
    var l = l
    for i in 0..<l.count {
        if i % 3 == 0 {
            l[i] = l[i..<l.count].sorted()[i / 3]
        }
    }
    return l
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
This function takes an array l and returns an array l' such that
l' is identical to l in the indicies that are not divisible by three, while its values at the indicies that are divisible by three are equal
to the values of the corresponding indicies of l, but sorted.
sortThird(l: [1, 2, 3]) == [1, 2, 3]
sortThird(l: [5, 6, 3, 4, 8, 9, 2]) == [2, 6, 3, 4, 8, 9, 5]
### Response:
```swift
func sortThird(l: [Int]) -> [Int] {
    var l = l
    for i in 0..<l.count {
        if i % 3 == 0 {
            l[i] = l[i..<l.count].sorted()[i / 3]
        }
    }
    return l
}
```

func sortThird(l: [Int]) -> [Int] {
    return l.enumerated().reduce([Int]()) { (result, element) -> [Int] in
        if element.offset % 3 == 0 {
            return result + [element.element]
        } else {
            return result + [l.sorted()[element.offset]]
        }
    }
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
This function takes an array l and returns an array l' such that
l' is identical to l in the indicies that are not divisible by three, while its values at the indicies that are divisible by three are equal
to the values of the corresponding indicies of l, but sorted.
sortThird(l: [1, 2, 3]) == [1, 2, 3]
sortThird(l: [5, 6, 3, 4, 8, 9, 2]) == [2, 6, 3, 4, 8, 9, 5]
### Response:
```swift
func sortThird(l: [Int]) -> [Int] {
    return l.enumerated().reduce([Int]()) { (result, element) -> [Int] in
        if element.offset % 3 == 0 {
            return result + [element.element]
        } else {
            return result + [l.sorted()[element.offset]]
        }
    }
}
```

func sortThird(l: [Int]) -> [Int] {
    return l.enumerated().map { (index, element) in
        if index % 3 == 0 {
            return element
        }
        return l.sorted()[index]
    }
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
This function takes an array l and returns an array l' such that
l' is identical to l in the indicies that are not divisible by three, while its values at the indicies that are divisible by three are equal
to the values of the corresponding indicies of l, but sorted.
sortThird(l: [1, 2, 3]) == [1, 2, 3]
sortThird(l: [5, 6, 3, 4, 8, 9, 2]) == [2, 6, 3, 4, 8, 9, 5]
### Response:
```swift
func sortThird(l: [Int]) -> [Int] {
    return l.enumerated().map { (index, element) in
        if index % 3 == 0 {
            return element
        }
        return l.sorted()[index]
    }
}
```

func sortThird(l: [Int]) -> [Int] {
    return l.enumerated().reduce(into: [Int]()) { result, pair in
        if pair.offset % 3 == 0 {
            result.append(pair.element)
        } else {
            result.insert(pair.element, at: pair.offset)
        }
    }
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
This function takes an array l and returns an array l' such that
l' is identical to l in the indicies that are not divisible by three, while its values at the indicies that are divisible by three are equal
to the values of the corresponding indicies of l, but sorted.
sortThird(l: [1, 2, 3]) == [1, 2, 3]
sortThird(l: [5, 6, 3, 4, 8, 9, 2]) == [2, 6, 3, 4, 8, 9, 5]
### Response:
```swift
func sortThird(l: [Int]) -> [Int] {
    return l.enumerated().reduce(into: [Int]()) { result, pair in
        if pair.offset % 3 == 0 {
            result.append(pair.element)
        } else {
            result.insert(pair.element, at: pair.offset)
        }
    }
}
```

func sortThird(l: [Int]) -> [Int] {
    return l.enumerated().reduce(into: []) { result, pair in
        if pair.offset % 3 == 0 {
            result.append(pair.element)
        } else {
            result.insert(pair.element, at: 0)
        }
    }
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
This function takes an array l and returns an array l' such that
l' is identical to l in the indicies that are not divisible by three, while its values at the indicies that are divisible by three are equal
to the values of the corresponding indicies of l, but sorted.
sortThird(l: [1, 2, 3]) == [1, 2, 3]
sortThird(l: [5, 6, 3, 4, 8, 9, 2]) == [2, 6, 3, 4, 8, 9, 5]
### Response:
```swift
func sortThird(l: [Int]) -> [Int] {
    return l.enumerated().reduce(into: []) { result, pair in
        if pair.offset % 3 == 0 {
            result.append(pair.element)
        } else {
            result.insert(pair.element, at: 0)
        }
    }
}
```

func sortThird(l: [Int]) -> [Int] {
    return l.enumerated().reduce(into: [Int]()) { (result, pair) in
        if pair.offset % 3 == 0 {
            result.append(pair.element)
        } else {
            result.insert(pair.element, at: pair.offset)
        }
    }
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
This function takes an array l and returns an array l' such that
l' is identical to l in the indicies that are not divisible by three, while its values at the indicies that are divisible by three are equal
to the values of the corresponding indicies of l, but sorted.
sortThird(l: [1, 2, 3]) == [1, 2, 3]
sortThird(l: [5, 6, 3, 4, 8, 9, 2]) == [2, 6, 3, 4, 8, 9, 5]
### Response:
```swift
func sortThird(l: [Int]) -> [Int] {
    return l.enumerated().reduce(into: [Int]()) { (result, pair) in
        if pair.offset % 3 == 0 {
            result.append(pair.element)
        } else {
            result.insert(pair.element, at: pair.offset)
        }
    }
}
```

func sortThird(l: [Int]) -> [Int] {
    return l.enumerated().reduce(into: [Int]()) {
        $0.append($1.element)
        if $1.offset % 3 == 2 {
            $0.sort()
        }
    }
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
This function takes an array l and returns an array l' such that
l' is identical to l in the indicies that are not divisible by three, while its values at the indicies that are divisible by three are equal
to the values of the corresponding indicies of l, but sorted.
sortThird(l: [1, 2, 3]) == [1, 2, 3]
sortThird(l: [5, 6, 3, 4, 8, 9, 2]) == [2, 6, 3, 4, 8, 9, 5]
### Response:
```swift
func sortThird(l: [Int]) -> [Int] {
    return l.enumerated().reduce(into: [Int]()) {
        $0.append($1.element)
        if $1.offset % 3 == 2 {
            $0.sort()
        }
    }
}
```

func sortThird(l: [Int]) -> [Int] {
    var result = [Int]()
    var index = 0
    for i in l {
        if index % 3 == 0 {
            result.append(i)
        } else {
            result.insert(i, at: 0)
        }
        index += 1
    }
    return result
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
This function takes an array l and returns an array l' such that
l' is identical to l in the indicies that are not divisible by three, while its values at the indicies that are divisible by three are equal
to the values of the corresponding indicies of l, but sorted.
sortThird(l: [1, 2, 3]) == [1, 2, 3]
sortThird(l: [5, 6, 3, 4, 8, 9, 2]) == [2, 6, 3, 4, 8, 9, 5]
### Response:
```swift
func sortThird(l: [Int]) -> [Int] {
    var result = [Int]()
    var index = 0
    for i in l {
        if index % 3 == 0 {
            result.append(i)
        } else {
            result.insert(i, at: 0)
        }
        index += 1
    }
    return result
}
```

func sortThird(l: [Int]) -> [Int] {
    return l.enumerated().reduce([Int]()) { (result, element) in
        let (index, value) = element
        return index % 3 == 0 ? result + [value] : result + [result[index % 3]]
    }
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
This function takes an array l and returns an array l' such that
l' is identical to l in the indicies that are not divisible by three, while its values at the indicies that are divisible by three are equal
to the values of the corresponding indicies of l, but sorted.
sortThird(l: [1, 2, 3]) == [1, 2, 3]
sortThird(l: [5, 6, 3, 4, 8, 9, 2]) == [2, 6, 3, 4, 8, 9, 5]
### Response:
```swift
func sortThird(l: [Int]) -> [Int] {
    return l.enumerated().reduce([Int]()) { (result, element) in
        let (index, value) = element
        return index % 3 == 0 ? result + [value] : result + [result[index % 3]]
    }
}
```

func unique(l: [Int]) -> [Int] {
    return Array(Set(l))
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Return sorted unique elements in an array
unique(l: [5, 3, 5, 2, 3, 3, 9, 0, 123]) == [0, 2, 3, 5, 9, 123]
### Response:
```swift
func unique(l: [Int]) -> [Int] {
    return Array(Set(l))
}
```

func unique(l: [Int]) -> [Int] {
    return Array(Set(l))
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Return sorted unique elements in an array
unique(l: [5, 3, 5, 2, 3, 3, 9, 0, 123]) == [0, 2, 3, 5, 9, 123]
### Response:
```swift
func unique(l: [Int]) -> [Int] {
    return Array(Set(l))
}
```

func unique(l: [Int]) -> [Int] {
    return Array(Set(l))
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Return sorted unique elements in an array
unique(l: [5, 3, 5, 2, 3, 3, 9, 0, 123]) == [0, 2, 3, 5, 9, 123]
### Response:
```swift
func unique(l: [Int]) -> [Int] {
    return Array(Set(l))
}
```

func unique(l: [Int]) -> [Int] {
    return Array(Set(l))
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Return sorted unique elements in an array
unique(l: [5, 3, 5, 2, 3, 3, 9, 0, 123]) == [0, 2, 3, 5, 9, 123]
### Response:
```swift
func unique(l: [Int]) -> [Int] {
    return Array(Set(l))
}
```

func unique(l: [Int]) -> [Int] {
    var uniqueArray = [Int]()
    for i in l {
        if !uniqueArray.contains(i) {
            uniqueArray.append(i)
        }
    }
    return uniqueArray.sorted()
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Return sorted unique elements in an array
unique(l: [5, 3, 5, 2, 3, 3, 9, 0, 123]) == [0, 2, 3, 5, 9, 123]
### Response:
```swift
func unique(l: [Int]) -> [Int] {
    var uniqueArray = [Int]()
    for i in l {
        if !uniqueArray.contains(i) {
            uniqueArray.append(i)
        }
    }
    return uniqueArray.sorted()
}
```

func unique(l: [Int]) -> [Int] {
    return Array(Set(l))
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Return sorted unique elements in an array
unique(l: [5, 3, 5, 2, 3, 3, 9, 0, 123]) == [0, 2, 3, 5, 9, 123]
### Response:
```swift
func unique(l: [Int]) -> [Int] {
    return Array(Set(l))
}
```

func unique(l: [Int]) -> [Int] {
    return Array(Set(l))
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Return sorted unique elements in an array
unique(l: [5, 3, 5, 2, 3, 3, 9, 0, 123]) == [0, 2, 3, 5, 9, 123]
### Response:
```swift
func unique(l: [Int]) -> [Int] {
    return Array(Set(l))
}
```

func unique(l: [Int]) -> [Int] {
    return Array(Set(l))
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Return sorted unique elements in an array
unique(l: [5, 3, 5, 2, 3, 3, 9, 0, 123]) == [0, 2, 3, 5, 9, 123]
### Response:
```swift
func unique(l: [Int]) -> [Int] {
    return Array(Set(l))
}
```

func unique(l: [Int]) -> [Int] {
    return Array(Set(l))
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Return sorted unique elements in an array
unique(l: [5, 3, 5, 2, 3, 3, 9, 0, 123]) == [0, 2, 3, 5, 9, 123]
### Response:
```swift
func unique(l: [Int]) -> [Int] {
    return Array(Set(l))
}
```

func unique(l: [Int]) -> [Int] {
    return Array(Set(l))
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Return sorted unique elements in an array
unique(l: [5, 3, 5, 2, 3, 3, 9, 0, 123]) == [0, 2, 3, 5, 9, 123]
### Response:
```swift
func unique(l: [Int]) -> [Int] {
    return Array(Set(l))
}
```

func maxElement(l: [Int]) -> Int {
    var max = l[0]
    for i in 1..<l.count {
        if l[i] > max {
            max = l[i]
        }
    }
    return max
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Return maximum element in the array.
maxElement(l: [1, 2, 3]) == 3
maxElement(l: [5, 3, -5, 2, -3, 3, 9, 0, 123, 1, -10]) == 123
### Response:
```swift
func maxElement(l: [Int]) -> Int {
    var max = l[0]
    for i in 1..<l.count {
        if l[i] > max {
            max = l[i]
        }
    }
    return max
}
```

func maxElement(l: [Int]) -> Int {
    return l.max()!
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Return maximum element in the array.
maxElement(l: [1, 2, 3]) == 3
maxElement(l: [5, 3, -5, 2, -3, 3, 9, 0, 123, 1, -10]) == 123
### Response:
```swift
func maxElement(l: [Int]) -> Int {
    return l.max()!
}
```

func maxElement(l: [Int]) -> Int {
    var max = l[0]
    for i in 1..<l.count {
        if l[i] > max {
            max = l[i]
        }
    }
    return max
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Return maximum element in the array.
maxElement(l: [1, 2, 3]) == 3
maxElement(l: [5, 3, -5, 2, -3, 3, 9, 0, 123, 1, -10]) == 123
### Response:
```swift
func maxElement(l: [Int]) -> Int {
    var max = l[0]
    for i in 1..<l.count {
        if l[i] > max {
            max = l[i]
        }
    }
    return max
}
```

func maxElement(l: [Int]) -> Int {
    var max = l[0]
    for i in l {
        if i > max {
            max = i
        }
    }
    return max
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Return maximum element in the array.
maxElement(l: [1, 2, 3]) == 3
maxElement(l: [5, 3, -5, 2, -3, 3, 9, 0, 123, 1, -10]) == 123
### Response:
```swift
func maxElement(l: [Int]) -> Int {
    var max = l[0]
    for i in l {
        if i > max {
            max = i
        }
    }
    return max
}
```

func maxElement(l: [Int]) -> Int {
    var max = l[0]
    for i in l {
        if i > max {
            max = i
        }
    }
    return max
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Return maximum element in the array.
maxElement(l: [1, 2, 3]) == 3
maxElement(l: [5, 3, -5, 2, -3, 3, 9, 0, 123, 1, -10]) == 123
### Response:
```swift
func maxElement(l: [Int]) -> Int {
    var max = l[0]
    for i in l {
        if i > max {
            max = i
        }
    }
    return max
}
```

func maxElement(l: [Int]) -> Int {
    var max = l[0]
    for i in 1..<l.count {
        if l[i] > max {
            max = l[i]
        }
    }
    return max
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Return maximum element in the array.
maxElement(l: [1, 2, 3]) == 3
maxElement(l: [5, 3, -5, 2, -3, 3, 9, 0, 123, 1, -10]) == 123
### Response:
```swift
func maxElement(l: [Int]) -> Int {
    var max = l[0]
    for i in 1..<l.count {
        if l[i] > max {
            max = l[i]
        }
    }
    return max
}
```

func maxElement(l: [Int]) -> Int {
    var max = l[0]
    for i in 1..<l.count {
        if l[i] > max {
            max = l[i]
        }
    }
    return max
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Return maximum element in the array.
maxElement(l: [1, 2, 3]) == 3
maxElement(l: [5, 3, -5, 2, -3, 3, 9, 0, 123, 1, -10]) == 123
### Response:
```swift
func maxElement(l: [Int]) -> Int {
    var max = l[0]
    for i in 1..<l.count {
        if l[i] > max {
            max = l[i]
        }
    }
    return max
}
```

func maxElement(l: [Int]) -> Int {
    var max = l[0]
    for i in 1..<l.count {
        if l[i] > max {
            max = l[i]
        }
    }
    return max
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Return maximum element in the array.
maxElement(l: [1, 2, 3]) == 3
maxElement(l: [5, 3, -5, 2, -3, 3, 9, 0, 123, 1, -10]) == 123
### Response:
```swift
func maxElement(l: [Int]) -> Int {
    var max = l[0]
    for i in 1..<l.count {
        if l[i] > max {
            max = l[i]
        }
    }
    return max
}
```

func maxElement(l: [Int]) -> Int {
    return l.max()!
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Return maximum element in the array.
maxElement(l: [1, 2, 3]) == 3
maxElement(l: [5, 3, -5, 2, -3, 3, 9, 0, 123, 1, -10]) == 123
### Response:
```swift
func maxElement(l: [Int]) -> Int {
    return l.max()!
}
```

func maxElement(l: [Int]) -> Int {
    var max = l[0]
    for i in 1..<l.count {
        if l[i] > max {
            max = l[i]
        }
    }
    return max
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Return maximum element in the array.
maxElement(l: [1, 2, 3]) == 3
maxElement(l: [5, 3, -5, 2, -3, 3, 9, 0, 123, 1, -10]) == 123
### Response:
```swift
func maxElement(l: [Int]) -> Int {
    var max = l[0]
    for i in 1..<l.count {
        if l[i] > max {
            max = l[i]
        }
    }
    return max
}
```

func fizzBuzz(n: Int) -> Int {
    var count = 0
    for i in 1...n {
        if i % 11 == 0 || i % 13 == 0 {
            let string = String(i)
            for char in string.characters {
                if char == "7" {
                    count += 1
                }
            }
        }
    }
    return count
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Return the number of times the digit 7 appears in integers less than n which are divisible by 11 or 13.
fizzBuzz(n: 50) == 0
fizzBuzz(n: 78) == 2
fizzBuzz(n: 79) == 3
### Response:
```swift
func fizzBuzz(n: Int) -> Int {
    var count = 0
    for i in 1...n {
        if i % 11 == 0 || i % 13 == 0 {
            let string = String(i)
            for char in string.characters {
                if char == "7" {
                    count += 1
                }
            }
        }
    }
    return count
}
```

func fizzBuzz(n: Int) -> Int {
    var count = 0
    for i in 1...n {
        if i % 11 == 0 || i % 13 == 0 {
            let str = String(i)
            for c in str.characters {
                if c == "7" {
                    count += 1
                }
            }
        }
    }
    return count
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Return the number of times the digit 7 appears in integers less than n which are divisible by 11 or 13.
fizzBuzz(n: 50) == 0
fizzBuzz(n: 78) == 2
fizzBuzz(n: 79) == 3
### Response:
```swift
func fizzBuzz(n: Int) -> Int {
    var count = 0
    for i in 1...n {
        if i % 11 == 0 || i % 13 == 0 {
            let str = String(i)
            for c in str.characters {
                if c == "7" {
                    count += 1
                }
            }
        }
    }
    return count
}
```

func fizzBuzz(n: Int) -> Int {
    var count = 0
    for i in 1...n {
        if i % 11 == 0 || i % 13 == 0 {
            let str = String(i)
            for char in str.characters {
                if char == "7" {
                    count += 1
                }
            }
        }
    }
    return count
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Return the number of times the digit 7 appears in integers less than n which are divisible by 11 or 13.
fizzBuzz(n: 50) == 0
fizzBuzz(n: 78) == 2
fizzBuzz(n: 79) == 3
### Response:
```swift
func fizzBuzz(n: Int) -> Int {
    var count = 0
    for i in 1...n {
        if i % 11 == 0 || i % 13 == 0 {
            let str = String(i)
            for char in str.characters {
                if char == "7" {
                    count += 1
                }
            }
        }
    }
    return count
}
```

func fizzBuzz(n: Int) -> Int {
    var count = 0
    for i in 1...n {
        if i % 11 == 0 || i % 13 == 0 {
            let str = String(i)
            count += str.contains("7") ? 1 : 0
        }
    }
    return count
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Return the number of times the digit 7 appears in integers less than n which are divisible by 11 or 13.
fizzBuzz(n: 50) == 0
fizzBuzz(n: 78) == 2
fizzBuzz(n: 79) == 3
### Response:
```swift
func fizzBuzz(n: Int) -> Int {
    var count = 0
    for i in 1...n {
        if i % 11 == 0 || i % 13 == 0 {
            let str = String(i)
            count += str.contains("7") ? 1 : 0
        }
    }
    return count
}
```

func fizzBuzz(n: Int) -> Int {
    var count = 0
    for i in 1...n {
        if i % 11 == 0 || i % 13 == 0 {
            let str = String(i)
            count += str.filter({ $0 == "7" }).count
        }
    }
    return count
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Return the number of times the digit 7 appears in integers less than n which are divisible by 11 or 13.
fizzBuzz(n: 50) == 0
fizzBuzz(n: 78) == 2
fizzBuzz(n: 79) == 3
### Response:
```swift
func fizzBuzz(n: Int) -> Int {
    var count = 0
    for i in 1...n {
        if i % 11 == 0 || i % 13 == 0 {
            let str = String(i)
            count += str.filter({ $0 == "7" }).count
        }
    }
    return count
}
```

func fizzBuzz(n: Int) -> Int {
    var count = 0
    for i in 1...n {
        if i % 11 == 0 || i % 13 == 0 {
            let str = String(i)
            if str.contains("7") {
                count += 1
            }
        }
    }
    return count
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Return the number of times the digit 7 appears in integers less than n which are divisible by 11 or 13.
fizzBuzz(n: 50) == 0
fizzBuzz(n: 78) == 2
fizzBuzz(n: 79) == 3
### Response:
```swift
func fizzBuzz(n: Int) -> Int {
    var count = 0
    for i in 1...n {
        if i % 11 == 0 || i % 13 == 0 {
            let str = String(i)
            if str.contains("7") {
                count += 1
            }
        }
    }
    return count
}
```

func fizzBuzz(n: Int) -> Int {
    var count = 0
    for i in 1...n {
        if i % 11 == 0 || i % 13 == 0 {
            let str = String(i)
            if str.contains("7") {
                count += 1
            }
        }
    }
    return count
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Return the number of times the digit 7 appears in integers less than n which are divisible by 11 or 13.
fizzBuzz(n: 50) == 0
fizzBuzz(n: 78) == 2
fizzBuzz(n: 79) == 3
### Response:
```swift
func fizzBuzz(n: Int) -> Int {
    var count = 0
    for i in 1...n {
        if i % 11 == 0 || i % 13 == 0 {
            let str = String(i)
            if str.contains("7") {
                count += 1
            }
        }
    }
    return count
}
```

func fizzBuzz(n: Int) -> Int {
    var count = 0
    for i in 1...n {
        if i % 11 == 0 || i % 13 == 0 {
            let str = String(i)
            count += str.filter { $0 == "7" }.count
        }
    }
    return count
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Return the number of times the digit 7 appears in integers less than n which are divisible by 11 or 13.
fizzBuzz(n: 50) == 0
fizzBuzz(n: 78) == 2
fizzBuzz(n: 79) == 3
### Response:
```swift
func fizzBuzz(n: Int) -> Int {
    var count = 0
    for i in 1...n {
        if i % 11 == 0 || i % 13 == 0 {
            let str = String(i)
            count += str.filter { $0 == "7" }.count
        }
    }
    return count
}
```

func fizzBuzz(n: Int) -> Int {
    var count = 0
    for i in 1...n {
        if i % 11 == 0 || i % 13 == 0 {
            let str = String(i)
            count += str.filter { $0 == "7" }.count
        }
    }
    return count
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Return the number of times the digit 7 appears in integers less than n which are divisible by 11 or 13.
fizzBuzz(n: 50) == 0
fizzBuzz(n: 78) == 2
fizzBuzz(n: 79) == 3
### Response:
```swift
func fizzBuzz(n: Int) -> Int {
    var count = 0
    for i in 1...n {
        if i % 11 == 0 || i % 13 == 0 {
            let str = String(i)
            count += str.filter { $0 == "7" }.count
        }
    }
    return count
}
```

func fizzBuzz(n: Int) -> Int {
    return (1...n).reduce(0) {
        $0 + ($1 % 11 == 0 || $1 % 13 == 0 ? String($1).contains("7") : 0)
    }
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Return the number of times the digit 7 appears in integers less than n which are divisible by 11 or 13.
fizzBuzz(n: 50) == 0
fizzBuzz(n: 78) == 2
fizzBuzz(n: 79) == 3
### Response:
```swift
func fizzBuzz(n: Int) -> Int {
    return (1...n).reduce(0) {
        $0 + ($1 % 11 == 0 || $1 % 13 == 0 ? String($1).contains("7") : 0)
    }
}
```

func sortEven(l: [Int]) -> [Int] {
    var even = [Int]()
    var odd = [Int]()
    for (index, value) in l.enumerated() {
        if index % 2 == 0 {
            even.append(value)
        } else {
            odd.append(value)
        }
    }
    return odd + even.sorted()
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
This function takes an array l and returns an array l' such that
l' is identical to l in the odd indicies, while its values at the even indicies are equal
to the values of the even indicies of l, but sorted.
sortEven(l: [1, 2, 3]) == [1, 2, 3]
sortEven(l: [5, 6, 3, 4]) == [3, 6, 5, 4]
### Response:
```swift
func sortEven(l: [Int]) -> [Int] {
    var even = [Int]()
    var odd = [Int]()
    for (index, value) in l.enumerated() {
        if index % 2 == 0 {
            even.append(value)
        } else {
            odd.append(value)
        }
    }
    return odd + even.sorted()
}
```

func sortEven(l: [Int]) -> [Int] {
    var result = [Int]()
    for (index, value) in l.enumerated() {
        if index % 2 == 0 {
            result.append(value)
        }
    }
    result.sort()
    return result
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
This function takes an array l and returns an array l' such that
l' is identical to l in the odd indicies, while its values at the even indicies are equal
to the values of the even indicies of l, but sorted.
sortEven(l: [1, 2, 3]) == [1, 2, 3]
sortEven(l: [5, 6, 3, 4]) == [3, 6, 5, 4]
### Response:
```swift
func sortEven(l: [Int]) -> [Int] {
    var result = [Int]()
    for (index, value) in l.enumerated() {
        if index % 2 == 0 {
            result.append(value)
        }
    }
    result.sort()
    return result
}
```

func sortEven(l: [Int]) -> [Int] {
    var l = l
    for i in 0..<l.count {
        if i % 2 == 0 {
            l.swapAt(i, i + 1)
        }
    }
    return l
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
This function takes an array l and returns an array l' such that
l' is identical to l in the odd indicies, while its values at the even indicies are equal
to the values of the even indicies of l, but sorted.
sortEven(l: [1, 2, 3]) == [1, 2, 3]
sortEven(l: [5, 6, 3, 4]) == [3, 6, 5, 4]
### Response:
```swift
func sortEven(l: [Int]) -> [Int] {
    var l = l
    for i in 0..<l.count {
        if i % 2 == 0 {
            l.swapAt(i, i + 1)
        }
    }
    return l
}
```

func sortEven(l: [Int]) -> [Int] {
    var even = [Int]()
    var odd = [Int]()
    for i in 0..<l.count {
        if i % 2 == 0 {
            even.append(l[i])
        } else {
            odd.append(l[i])
        }
    }
    return odd + even.sorted()
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
This function takes an array l and returns an array l' such that
l' is identical to l in the odd indicies, while its values at the even indicies are equal
to the values of the even indicies of l, but sorted.
sortEven(l: [1, 2, 3]) == [1, 2, 3]
sortEven(l: [5, 6, 3, 4]) == [3, 6, 5, 4]
### Response:
```swift
func sortEven(l: [Int]) -> [Int] {
    var even = [Int]()
    var odd = [Int]()
    for i in 0..<l.count {
        if i % 2 == 0 {
            even.append(l[i])
        } else {
            odd.append(l[i])
        }
    }
    return odd + even.sorted()
}
```

func sortEven(l: [Int]) -> [Int] {
    var result = [Int]()
    for (index, value) in l.enumerated() {
        if index % 2 == 0 {
            result.append(value)
        } else {
            result.insert(value, at: result.count)
        }
    }
    return result
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
This function takes an array l and returns an array l' such that
l' is identical to l in the odd indicies, while its values at the even indicies are equal
to the values of the even indicies of l, but sorted.
sortEven(l: [1, 2, 3]) == [1, 2, 3]
sortEven(l: [5, 6, 3, 4]) == [3, 6, 5, 4]
### Response:
```swift
func sortEven(l: [Int]) -> [Int] {
    var result = [Int]()
    for (index, value) in l.enumerated() {
        if index % 2 == 0 {
            result.append(value)
        } else {
            result.insert(value, at: result.count)
        }
    }
    return result
}
```

func sortEven(l: [Int]) -> [Int] {
    var even = [Int]()
    var odd = [Int]()
    for i in 0..<l.count {
        if i % 2 == 0 {
            even.append(l[i])
        } else {
            odd.append(l[i])
        }
    }
    return odd + even.sorted()
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
This function takes an array l and returns an array l' such that
l' is identical to l in the odd indicies, while its values at the even indicies are equal
to the values of the even indicies of l, but sorted.
sortEven(l: [1, 2, 3]) == [1, 2, 3]
sortEven(l: [5, 6, 3, 4]) == [3, 6, 5, 4]
### Response:
```swift
func sortEven(l: [Int]) -> [Int] {
    var even = [Int]()
    var odd = [Int]()
    for i in 0..<l.count {
        if i % 2 == 0 {
            even.append(l[i])
        } else {
            odd.append(l[i])
        }
    }
    return odd + even.sorted()
}
```

func sortEven(l: [Int]) -> [Int] {
    var result = [Int]()
    for (index, value) in l.enumerated() {
        if index % 2 == 0 {
            result.append(value)
        }
    }
    for (index, value) in l.enumerated() {
        if index % 2 == 1 {
            result.append(value)
        }
    }
    return result
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
This function takes an array l and returns an array l' such that
l' is identical to l in the odd indicies, while its values at the even indicies are equal
to the values of the even indicies of l, but sorted.
sortEven(l: [1, 2, 3]) == [1, 2, 3]
sortEven(l: [5, 6, 3, 4]) == [3, 6, 5, 4]
### Response:
```swift
func sortEven(l: [Int]) -> [Int] {
    var result = [Int]()
    for (index, value) in l.enumerated() {
        if index % 2 == 0 {
            result.append(value)
        }
    }
    for (index, value) in l.enumerated() {
        if index % 2 == 1 {
            result.append(value)
        }
    }
    return result
}
```

func sortEven(l: [Int]) -> [Int] {
    var result = [Int]()
    for (index, value) in l.enumerated() {
        if index % 2 == 0 {
            result.append(value)
        }
    }
    result.sort()
    for (index, value) in l.enumerated() {
        if index % 2 == 1 {
            result.append(value)
        }
    }
    return result
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
This function takes an array l and returns an array l' such that
l' is identical to l in the odd indicies, while its values at the even indicies are equal
to the values of the even indicies of l, but sorted.
sortEven(l: [1, 2, 3]) == [1, 2, 3]
sortEven(l: [5, 6, 3, 4]) == [3, 6, 5, 4]
### Response:
```swift
func sortEven(l: [Int]) -> [Int] {
    var result = [Int]()
    for (index, value) in l.enumerated() {
        if index % 2 == 0 {
            result.append(value)
        }
    }
    result.sort()
    for (index, value) in l.enumerated() {
        if index % 2 == 1 {
            result.append(value)
        }
    }
    return result
}
```

func sortEven(l: [Int]) -> [Int] {
    var result = [Int]()
    for i in 0..<l.count {
        if i % 2 == 0 {
            result.append(l[i])
        } else {
            result.append(l[i])
        }
    }
    return result
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
This function takes an array l and returns an array l' such that
l' is identical to l in the odd indicies, while its values at the even indicies are equal
to the values of the even indicies of l, but sorted.
sortEven(l: [1, 2, 3]) == [1, 2, 3]
sortEven(l: [5, 6, 3, 4]) == [3, 6, 5, 4]
### Response:
```swift
func sortEven(l: [Int]) -> [Int] {
    var result = [Int]()
    for i in 0..<l.count {
        if i % 2 == 0 {
            result.append(l[i])
        } else {
            result.append(l[i])
        }
    }
    return result
}
```

func sortEven(l: [Int]) -> [Int] {
    var result = [Int]()
    var odd = [Int]()
    var even = [Int]()
    for i in l {
        if i % 2 == 0 {
            even.append(i)
        } else {
            odd.append(i)
        }
    }
    even.sort()
    for i in 0..<l.count {
        if i % 2 == 0 {
            result.append(even[i/2])
        } else {
            result.append(odd[i/2])
        }
    }
    return result
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
This function takes an array l and returns an array l' such that
l' is identical to l in the odd indicies, while its values at the even indicies are equal
to the values of the even indicies of l, but sorted.
sortEven(l: [1, 2, 3]) == [1, 2, 3]
sortEven(l: [5, 6, 3, 4]) == [3, 6, 5, 4]
### Response:
```swift
func sortEven(l: [Int]) -> [Int] {
    var result = [Int]()
    var odd = [Int]()
    var even = [Int]()
    for i in l {
        if i % 2 == 0 {
            even.append(i)
        } else {
            odd.append(i)
        }
    }
    even.sort()
    for i in 0..<l.count {
        if i % 2 == 0 {
            result.append(even[i/2])
        } else {
            result.append(odd[i/2])
        }
    }
    return result
}
```

func primeFib(n: Int) -> Int {
    var a = 1
    var b = 1
    var c = 0
    var i = 0
    while i < n {
        c = a + b
        a = b
        b = c
        i += 1
    }
    return c
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
prime_fib returns n-th number that is a Fibonacci number and it's also prime.
primeFib(n: 1) == 2
primeFib(n: 2) == 3
primeFib(n: 3) == 5
primeFib(n: 4) == 13
primeFib(n: 5) == 89
### Response:
```swift
func primeFib(n: Int) -> Int {
    var a = 1
    var b = 1
    var c = 0
    var i = 0
    while i < n {
        c = a + b
        a = b
        b = c
        i += 1
    }
    return c
}
```

func primeFib(n: Int) -> Int {
    var a = 0
    var b = 1
    var c = 1
    var i = 0
    while i < n {
        c = a + b
        a = b
        b = c
        i += 1
    }
    return c
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
prime_fib returns n-th number that is a Fibonacci number and it's also prime.
primeFib(n: 1) == 2
primeFib(n: 2) == 3
primeFib(n: 3) == 5
primeFib(n: 4) == 13
primeFib(n: 5) == 89
### Response:
```swift
func primeFib(n: Int) -> Int {
    var a = 0
    var b = 1
    var c = 1
    var i = 0
    while i < n {
        c = a + b
        a = b
        b = c
        i += 1
    }
    return c
}
```

func primeFib(n: Int) -> Int {
    var a = 0
    var b = 1
    var c = 0
    var count = 0
    while count < n {
        c = a + b
        a = b
        b = c
        count += 1
    }
    return a
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
prime_fib returns n-th number that is a Fibonacci number and it's also prime.
primeFib(n: 1) == 2
primeFib(n: 2) == 3
primeFib(n: 3) == 5
primeFib(n: 4) == 13
primeFib(n: 5) == 89
### Response:
```swift
func primeFib(n: Int) -> Int {
    var a = 0
    var b = 1
    var c = 0
    var count = 0
    while count < n {
        c = a + b
        a = b
        b = c
        count += 1
    }
    return a
}
```

func primeFib(n: Int) -> Int {
    var a = 1
    var b = 1
    var c = 0
    var count = 0
    while count < n {
        c = a + b
        a = b
        b = c
        count += 1
    }
    return b
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
prime_fib returns n-th number that is a Fibonacci number and it's also prime.
primeFib(n: 1) == 2
primeFib(n: 2) == 3
primeFib(n: 3) == 5
primeFib(n: 4) == 13
primeFib(n: 5) == 89
### Response:
```swift
func primeFib(n: Int) -> Int {
    var a = 1
    var b = 1
    var c = 0
    var count = 0
    while count < n {
        c = a + b
        a = b
        b = c
        count += 1
    }
    return b
}
```

func primeFib(n: Int) -> Int {
    var a = 1
    var b = 1
    var count = 0
    while count < n {
        let c = a + b
        if isPrime(c) {
            a = b
            b = c
            count += 1
        } else {
            b = c
        }
    }
    return b
}

func isPrime(_ n: Int) -> Bool {
    guard n > 1 else { return false }
    var i = 2
    while i <= Int(sqrt(Double(n))) {
        if n % i == 0 {
            return false
        }
        i += 1
    }
    return true
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
prime_fib returns n-th number that is a Fibonacci number and it's also prime.
primeFib(n: 1) == 2
primeFib(n: 2) == 3
primeFib(n: 3) == 5
primeFib(n: 4) == 13
primeFib(n: 5) == 89
### Response:
```swift
func primeFib(n: Int) -> Int {
    var a = 1
    var b = 1
    var count = 0
    while count < n {
        let c = a + b
        if isPrime(c) {
            a = b
            b = c
            count += 1
        } else {
            b = c
        }
    }
    return b
}

func isPrime(_ n: Int) -> Bool {
    guard n > 1 else { return false }
    var i = 2
    while i <= Int(sqrt(Double(n))) {
        if n % i == 0 {
            return false
        }
        i += 1
    }
    return true
}
```

func primeFib(n: Int) -> Int {
    var a = 1
    var b = 1
    var c = 0
    var count = 0
    while count < n {
        c = a + b
        if isPrime(n: c) {
            a = b
            b = c
            count += 1
        } else {
            b = c
        }
    }
    return c
}

func isPrime(n: Int) -> Bool {
    if n <= 1 {
        return false
    }
    for i in 2..<n {
        if n % i == 0 {
            return false
        }
    }
    return true
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
prime_fib returns n-th number that is a Fibonacci number and it's also prime.
primeFib(n: 1) == 2
primeFib(n: 2) == 3
primeFib(n: 3) == 5
primeFib(n: 4) == 13
primeFib(n: 5) == 89
### Response:
```swift
func primeFib(n: Int) -> Int {
    var a = 1
    var b = 1
    var c = 0
    var count = 0
    while count < n {
        c = a + b
        if isPrime(n: c) {
            a = b
            b = c
            count += 1
        } else {
            b = c
        }
    }
    return c
}

func isPrime(n: Int) -> Bool {
    if n <= 1 {
        return false
    }
    for i in 2..<n {
        if n % i == 0 {
            return false
        }
    }
    return true
}
```

func primeFib(n: Int) -> Int {
    var a = 0
    var b = 1
    var c = 1
    var i = 1
    while i < n {
        c = a + b
        a = b
        b = c
        i += 1
    }
    return a
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
prime_fib returns n-th number that is a Fibonacci number and it's also prime.
primeFib(n: 1) == 2
primeFib(n: 2) == 3
primeFib(n: 3) == 5
primeFib(n: 4) == 13
primeFib(n: 5) == 89
### Response:
```swift
func primeFib(n: Int) -> Int {
    var a = 0
    var b = 1
    var c = 1
    var i = 1
    while i < n {
        c = a + b
        a = b
        b = c
        i += 1
    }
    return a
}
```

func primeFib(n: Int) -> Int {
    var a = 1
    var b = 1
    var c = 0
    var count = 0
    while count < n {
        c = a + b
        a = b
        b = c
        if isPrime(n: c) {
            count += 1
        }
    }
    return c
}

func isPrime(n: Int) -> Bool {
    if n < 2 {
        return false
    }
    for i in 2..<n {
        if n % i == 0 {
            return false
        }
    }
    return true
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
prime_fib returns n-th number that is a Fibonacci number and it's also prime.
primeFib(n: 1) == 2
primeFib(n: 2) == 3
primeFib(n: 3) == 5
primeFib(n: 4) == 13
primeFib(n: 5) == 89
### Response:
```swift
func primeFib(n: Int) -> Int {
    var a = 1
    var b = 1
    var c = 0
    var count = 0
    while count < n {
        c = a + b
        a = b
        b = c
        if isPrime(n: c) {
            count += 1
        }
    }
    return c
}

func isPrime(n: Int) -> Bool {
    if n < 2 {
        return false
    }
    for i in 2..<n {
        if n % i == 0 {
            return false
        }
    }
    return true
}
```

func primeFib(n: Int) -> Int {
    var a = 1
    var b = 1
    var c = 0
    var count = 0
    while count < n {
        c = a + b
        a = b
        b = c
        if isPrime(c) {
            count += 1
        }
    }
    return c
}

func isPrime(_ number: Int) -> Bool {
    guard number > 1 else { return false }
    for i in 2..<number {
        if number % i == 0 {
            return false
        }
    }
    return true
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
prime_fib returns n-th number that is a Fibonacci number and it's also prime.
primeFib(n: 1) == 2
primeFib(n: 2) == 3
primeFib(n: 3) == 5
primeFib(n: 4) == 13
primeFib(n: 5) == 89
### Response:
```swift
func primeFib(n: Int) -> Int {
    var a = 1
    var b = 1
    var c = 0
    var count = 0
    while count < n {
        c = a + b
        a = b
        b = c
        if isPrime(c) {
            count += 1
        }
    }
    return c
}

func isPrime(_ number: Int) -> Bool {
    guard number > 1 else { return false }
    for i in 2..<number {
        if number % i == 0 {
            return false
        }
    }
    return true
}
```

func primeFib(n: Int) -> Int {
    var a = 0
    var b = 1
    var count = 0
    while count < n {
        let c = a + b
        if isPrime(c) {
            a = b
            b = c
            count += 1
        } else {
            b = c
        }
    }
    return a
}

func isPrime(_ n: Int) -> Bool {
    if n < 2 {
        return false
    }
    for i in 2..<n {
        if n % i == 0 {
            return false
        }
    }
    return true
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
prime_fib returns n-th number that is a Fibonacci number and it's also prime.
primeFib(n: 1) == 2
primeFib(n: 2) == 3
primeFib(n: 3) == 5
primeFib(n: 4) == 13
primeFib(n: 5) == 89
### Response:
```swift
func primeFib(n: Int) -> Int {
    var a = 0
    var b = 1
    var count = 0
    while count < n {
        let c = a + b
        if isPrime(c) {
            a = b
            b = c
            count += 1
        } else {
            b = c
        }
    }
    return a
}

func isPrime(_ n: Int) -> Bool {
    if n < 2 {
        return false
    }
    for i in 2..<n {
        if n % i == 0 {
            return false
        }
    }
    return true
}
```

func triplesSumToZero(l: [Int]) -> Bool {
    var set = Set<Int>()
    for i in l {
        if set.contains(i) {
            return true
        }
        set.insert(-i)
    }
    return false
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
triples_sum_to_zero takes an array of integers as an input.
it returns true if there are three distinct elements in the array that
sum to zero, and false otherwise.
triplesSumToZero(l: [1, 3, 5, 0]) == false
triplesSumToZero(l: [1, 3, -2, 1]) == true
triplesSumToZero(l: [1, 2, 3, 7]) == false
triplesSumToZero(l: [2, 4, -5, 3, 9, 7]) == true
triplesSumToZero(l: [1]) == false
### Response:
```swift
func triplesSumToZero(l: [Int]) -> Bool {
    var set = Set<Int>()
    for i in l {
        if set.contains(i) {
            return true
        }
        set.insert(-i)
    }
    return false
}
```

func triplesSumToZero(l: [Int]) -> Bool {
    var dict = [Int: Int]()
    for i in l {
        if dict[i] == nil {
            dict[i] = 1
        } else {
            dict[i]! += 1
        }
    }
    for (key, value) in dict {
        if value >= 3 {
            return true
        }
    }
    return false
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
triples_sum_to_zero takes an array of integers as an input.
it returns true if there are three distinct elements in the array that
sum to zero, and false otherwise.
triplesSumToZero(l: [1, 3, 5, 0]) == false
triplesSumToZero(l: [1, 3, -2, 1]) == true
triplesSumToZero(l: [1, 2, 3, 7]) == false
triplesSumToZero(l: [2, 4, -5, 3, 9, 7]) == true
triplesSumToZero(l: [1]) == false
### Response:
```swift
func triplesSumToZero(l: [Int]) -> Bool {
    var dict = [Int: Int]()
    for i in l {
        if dict[i] == nil {
            dict[i] = 1
        } else {
            dict[i]! += 1
        }
    }
    for (key, value) in dict {
        if value >= 3 {
            return true
        }
    }
    return false
}
```

func triplesSumToZero(l: [Int]) -> Bool {
    var dict = [Int: Int]()
    for i in l {
        if let count = dict[i] {
            dict[i] = count + 1
        } else {
            dict[i] = 1
        }
    }
    for (key, value) in dict {
        if value >= 3 {
            return true
        }
    }
    return false
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
triples_sum_to_zero takes an array of integers as an input.
it returns true if there are three distinct elements in the array that
sum to zero, and false otherwise.
triplesSumToZero(l: [1, 3, 5, 0]) == false
triplesSumToZero(l: [1, 3, -2, 1]) == true
triplesSumToZero(l: [1, 2, 3, 7]) == false
triplesSumToZero(l: [2, 4, -5, 3, 9, 7]) == true
triplesSumToZero(l: [1]) == false
### Response:
```swift
func triplesSumToZero(l: [Int]) -> Bool {
    var dict = [Int: Int]()
    for i in l {
        if let count = dict[i] {
            dict[i] = count + 1
        } else {
            dict[i] = 1
        }
    }
    for (key, value) in dict {
        if value >= 3 {
            return true
        }
    }
    return false
}
```

func triplesSumToZero(l: [Int]) -> Bool {
    let sorted = l.sorted()
    for i in 0..<sorted.count-2 {
        let target = -sorted[i]
        var left = i + 1
        var right = sorted.count - 1
        while left < right {
            let sum = sorted[left] + sorted[right]
            if sum == target {
                return true
            } else if sum < target {
                left += 1
            } else {
                right -= 1
            }
        }
    }
    return false
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
triples_sum_to_zero takes an array of integers as an input.
it returns true if there are three distinct elements in the array that
sum to zero, and false otherwise.
triplesSumToZero(l: [1, 3, 5, 0]) == false
triplesSumToZero(l: [1, 3, -2, 1]) == true
triplesSumToZero(l: [1, 2, 3, 7]) == false
triplesSumToZero(l: [2, 4, -5, 3, 9, 7]) == true
triplesSumToZero(l: [1]) == false
### Response:
```swift
func triplesSumToZero(l: [Int]) -> Bool {
    let sorted = l.sorted()
    for i in 0..<sorted.count-2 {
        let target = -sorted[i]
        var left = i + 1
        var right = sorted.count - 1
        while left < right {
            let sum = sorted[left] + sorted[right]
            if sum == target {
                return true
            } else if sum < target {
                left += 1
            } else {
                right -= 1
            }
        }
    }
    return false
}
```

func triplesSumToZero(l: [Int]) -> Bool {
    let sorted = l.sorted()
    for i in 0..<sorted.count-2 {
        let a = sorted[i]
        let b = sorted[i+1]
        let c = sorted[i+2]
        if a+b+c == 0 {
            return true
        }
    }
    return false
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
triples_sum_to_zero takes an array of integers as an input.
it returns true if there are three distinct elements in the array that
sum to zero, and false otherwise.
triplesSumToZero(l: [1, 3, 5, 0]) == false
triplesSumToZero(l: [1, 3, -2, 1]) == true
triplesSumToZero(l: [1, 2, 3, 7]) == false
triplesSumToZero(l: [2, 4, -5, 3, 9, 7]) == true
triplesSumToZero(l: [1]) == false
### Response:
```swift
func triplesSumToZero(l: [Int]) -> Bool {
    let sorted = l.sorted()
    for i in 0..<sorted.count-2 {
        let a = sorted[i]
        let b = sorted[i+1]
        let c = sorted[i+2]
        if a+b+c == 0 {
            return true
        }
    }
    return false
}
```

func triplesSumToZero(l: [Int]) -> Bool {
    var dict = [Int: Int]()
    for i in l {
        if dict[i] == nil {
            dict[i] = 1
        } else {
            dict[i]! += 1
        }
    }
    for (key, value) in dict {
        if value >= 3 {
            return true
        }
    }
    return false
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
triples_sum_to_zero takes an array of integers as an input.
it returns true if there are three distinct elements in the array that
sum to zero, and false otherwise.
triplesSumToZero(l: [1, 3, 5, 0]) == false
triplesSumToZero(l: [1, 3, -2, 1]) == true
triplesSumToZero(l: [1, 2, 3, 7]) == false
triplesSumToZero(l: [2, 4, -5, 3, 9, 7]) == true
triplesSumToZero(l: [1]) == false
### Response:
```swift
func triplesSumToZero(l: [Int]) -> Bool {
    var dict = [Int: Int]()
    for i in l {
        if dict[i] == nil {
            dict[i] = 1
        } else {
            dict[i]! += 1
        }
    }
    for (key, value) in dict {
        if value >= 3 {
            return true
        }
    }
    return false
}
```

func triplesSumToZero(l: [Int]) -> Bool {
    var dict = [Int: Int]()
    for i in l {
        if let count = dict[i] {
            dict[i] = count + 1
        } else {
            dict[i] = 1
        }
    }
    for (key, value) in dict {
        if value >= 3 {
            return true
        }
    }
    return false
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
triples_sum_to_zero takes an array of integers as an input.
it returns true if there are three distinct elements in the array that
sum to zero, and false otherwise.
triplesSumToZero(l: [1, 3, 5, 0]) == false
triplesSumToZero(l: [1, 3, -2, 1]) == true
triplesSumToZero(l: [1, 2, 3, 7]) == false
triplesSumToZero(l: [2, 4, -5, 3, 9, 7]) == true
triplesSumToZero(l: [1]) == false
### Response:
```swift
func triplesSumToZero(l: [Int]) -> Bool {
    var dict = [Int: Int]()
    for i in l {
        if let count = dict[i] {
            dict[i] = count + 1
        } else {
            dict[i] = 1
        }
    }
    for (key, value) in dict {
        if value >= 3 {
            return true
        }
    }
    return false
}
```

func triplesSumToZero(l: [Int]) -> Bool {
    var set = Set<Int>()
    for i in l {
        if set.contains(i) {
            return true
        }
        set.insert(-i)
    }
    return false
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
triples_sum_to_zero takes an array of integers as an input.
it returns true if there are three distinct elements in the array that
sum to zero, and false otherwise.
triplesSumToZero(l: [1, 3, 5, 0]) == false
triplesSumToZero(l: [1, 3, -2, 1]) == true
triplesSumToZero(l: [1, 2, 3, 7]) == false
triplesSumToZero(l: [2, 4, -5, 3, 9, 7]) == true
triplesSumToZero(l: [1]) == false
### Response:
```swift
func triplesSumToZero(l: [Int]) -> Bool {
    var set = Set<Int>()
    for i in l {
        if set.contains(i) {
            return true
        }
        set.insert(-i)
    }
    return false
}
```

func triplesSumToZero(l: [Int]) -> Bool {
    let set = Set(l)
    return set.count > 1 && set.contains(where: { $0 != 0 && l.contains(where: { $0 == -$0 }) })
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
triples_sum_to_zero takes an array of integers as an input.
it returns true if there are three distinct elements in the array that
sum to zero, and false otherwise.
triplesSumToZero(l: [1, 3, 5, 0]) == false
triplesSumToZero(l: [1, 3, -2, 1]) == true
triplesSumToZero(l: [1, 2, 3, 7]) == false
triplesSumToZero(l: [2, 4, -5, 3, 9, 7]) == true
triplesSumToZero(l: [1]) == false
### Response:
```swift
func triplesSumToZero(l: [Int]) -> Bool {
    let set = Set(l)
    return set.count > 1 && set.contains(where: { $0 != 0 && l.contains(where: { $0 == -$0 }) })
}
```

func triplesSumToZero(l: [Int]) -> Bool {
    let sortedArray = l.sorted()
    for i in 0..<sortedArray.count {
        let target = -sortedArray[i]
        var left = i + 1
        var right = sortedArray.count - 1
        while left < right {
            if sortedArray[left] + sortedArray[right] == target {
                return true
            } else if sortedArray[left] + sortedArray[right] < target {
                left += 1
            } else {
                right -= 1
            }
        }
    }
    return false
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
triples_sum_to_zero takes an array of integers as an input.
it returns true if there are three distinct elements in the array that
sum to zero, and false otherwise.
triplesSumToZero(l: [1, 3, 5, 0]) == false
triplesSumToZero(l: [1, 3, -2, 1]) == true
triplesSumToZero(l: [1, 2, 3, 7]) == false
triplesSumToZero(l: [2, 4, -5, 3, 9, 7]) == true
triplesSumToZero(l: [1]) == false
### Response:
```swift
func triplesSumToZero(l: [Int]) -> Bool {
    let sortedArray = l.sorted()
    for i in 0..<sortedArray.count {
        let target = -sortedArray[i]
        var left = i + 1
        var right = sortedArray.count - 1
        while left < right {
            if sortedArray[left] + sortedArray[right] == target {
                return true
            } else if sortedArray[left] + sortedArray[right] < target {
                left += 1
            } else {
                right -= 1
            }
        }
    }
    return false
}
```

func carRaceCollision(n: Int) -> Int {
    return n * (n - 1) / 2
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Imagine a road that's a perfectly straight infinitely long line.
n cars are driving left to right;  simultaneously, a different set of n cars
are driving right to left.   The two sets of cars start out being very far from
each other.  All cars move in the same speed.  Two cars are said to collide
when a car that's moving left to right hits a car that's moving right to left.
However, the cars are infinitely sturdy and strong; as a result, they continue moving
in their trajectory as if they did not collide.
This function outputs the number of such collisions.

### Response:
```swift
func carRaceCollision(n: Int) -> Int {
    return n * (n - 1) / 2
}
```

func carRaceCollision(n: Int) -> Int {
    return n * (n - 1) / 2
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Imagine a road that's a perfectly straight infinitely long line.
n cars are driving left to right;  simultaneously, a different set of n cars
are driving right to left.   The two sets of cars start out being very far from
each other.  All cars move in the same speed.  Two cars are said to collide
when a car that's moving left to right hits a car that's moving right to left.
However, the cars are infinitely sturdy and strong; as a result, they continue moving
in their trajectory as if they did not collide.
This function outputs the number of such collisions.

### Response:
```swift
func carRaceCollision(n: Int) -> Int {
    return n * (n - 1) / 2
}
```

func carRaceCollision(n: Int) -> Int {
    return n * (n - 1) / 2
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Imagine a road that's a perfectly straight infinitely long line.
n cars are driving left to right;  simultaneously, a different set of n cars
are driving right to left.   The two sets of cars start out being very far from
each other.  All cars move in the same speed.  Two cars are said to collide
when a car that's moving left to right hits a car that's moving right to left.
However, the cars are infinitely sturdy and strong; as a result, they continue moving
in their trajectory as if they did not collide.
This function outputs the number of such collisions.

### Response:
```swift
func carRaceCollision(n: Int) -> Int {
    return n * (n - 1) / 2
}
```

func carRaceCollision(n: Int) -> Int {
    return n * (n - 1) / 2
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Imagine a road that's a perfectly straight infinitely long line.
n cars are driving left to right;  simultaneously, a different set of n cars
are driving right to left.   The two sets of cars start out being very far from
each other.  All cars move in the same speed.  Two cars are said to collide
when a car that's moving left to right hits a car that's moving right to left.
However, the cars are infinitely sturdy and strong; as a result, they continue moving
in their trajectory as if they did not collide.
This function outputs the number of such collisions.

### Response:
```swift
func carRaceCollision(n: Int) -> Int {
    return n * (n - 1) / 2
}
```

func carRaceCollision(n: Int) -> Int {
    return n * (n - 1) / 2
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Imagine a road that's a perfectly straight infinitely long line.
n cars are driving left to right;  simultaneously, a different set of n cars
are driving right to left.   The two sets of cars start out being very far from
each other.  All cars move in the same speed.  Two cars are said to collide
when a car that's moving left to right hits a car that's moving right to left.
However, the cars are infinitely sturdy and strong; as a result, they continue moving
in their trajectory as if they did not collide.
This function outputs the number of such collisions.

### Response:
```swift
func carRaceCollision(n: Int) -> Int {
    return n * (n - 1) / 2
}
```

func carRaceCollision(n: Int) -> Int {
    return n * (n - 1) / 2
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Imagine a road that's a perfectly straight infinitely long line.
n cars are driving left to right;  simultaneously, a different set of n cars
are driving right to left.   The two sets of cars start out being very far from
each other.  All cars move in the same speed.  Two cars are said to collide
when a car that's moving left to right hits a car that's moving right to left.
However, the cars are infinitely sturdy and strong; as a result, they continue moving
in their trajectory as if they did not collide.
This function outputs the number of such collisions.

### Response:
```swift
func carRaceCollision(n: Int) -> Int {
    return n * (n - 1) / 2
}
```

func carRaceCollision(n: Int) -> Int {
    return n * (n - 1) / 2
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Imagine a road that's a perfectly straight infinitely long line.
n cars are driving left to right;  simultaneously, a different set of n cars
are driving right to left.   The two sets of cars start out being very far from
each other.  All cars move in the same speed.  Two cars are said to collide
when a car that's moving left to right hits a car that's moving right to left.
However, the cars are infinitely sturdy and strong; as a result, they continue moving
in their trajectory as if they did not collide.
This function outputs the number of such collisions.

### Response:
```swift
func carRaceCollision(n: Int) -> Int {
    return n * (n - 1) / 2
}
```

func carRaceCollision(n: Int) -> Int {
    return n * (n - 1) / 2
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Imagine a road that's a perfectly straight infinitely long line.
n cars are driving left to right;  simultaneously, a different set of n cars
are driving right to left.   The two sets of cars start out being very far from
each other.  All cars move in the same speed.  Two cars are said to collide
when a car that's moving left to right hits a car that's moving right to left.
However, the cars are infinitely sturdy and strong; as a result, they continue moving
in their trajectory as if they did not collide.
This function outputs the number of such collisions.

### Response:
```swift
func carRaceCollision(n: Int) -> Int {
    return n * (n - 1) / 2
}
```

func carRaceCollision(n: Int) -> Int {
    return n * (n - 1) / 2
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Imagine a road that's a perfectly straight infinitely long line.
n cars are driving left to right;  simultaneously, a different set of n cars
are driving right to left.   The two sets of cars start out being very far from
each other.  All cars move in the same speed.  Two cars are said to collide
when a car that's moving left to right hits a car that's moving right to left.
However, the cars are infinitely sturdy and strong; as a result, they continue moving
in their trajectory as if they did not collide.
This function outputs the number of such collisions.

### Response:
```swift
func carRaceCollision(n: Int) -> Int {
    return n * (n - 1) / 2
}
```

func carRaceCollision(n: Int) -> Int {
    return n * (n - 1) / 2
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Imagine a road that's a perfectly straight infinitely long line.
n cars are driving left to right;  simultaneously, a different set of n cars
are driving right to left.   The two sets of cars start out being very far from
each other.  All cars move in the same speed.  Two cars are said to collide
when a car that's moving left to right hits a car that's moving right to left.
However, the cars are infinitely sturdy and strong; as a result, they continue moving
in their trajectory as if they did not collide.
This function outputs the number of such collisions.

### Response:
```swift
func carRaceCollision(n: Int) -> Int {
    return n * (n - 1) / 2
}
```

func incrList(l: [Int]) -> [Int] {
    return l.map { $0 + 1 }
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Return array with elements incremented by 1.
incrList(l: [1, 2, 3]) == [2, 3, 4]
incrList(l: [5, 3, 5, 2, 3, 3, 9, 0, 123]) == [6, 4, 6, 3, 4, 4, 10, 1, 124]
### Response:
```swift
func incrList(l: [Int]) -> [Int] {
    return l.map { $0 + 1 }
}
```

func incrList(l: [Int]) -> [Int] {
    return l.map { $0 + 1 }
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Return array with elements incremented by 1.
incrList(l: [1, 2, 3]) == [2, 3, 4]
incrList(l: [5, 3, 5, 2, 3, 3, 9, 0, 123]) == [6, 4, 6, 3, 4, 4, 10, 1, 124]
### Response:
```swift
func incrList(l: [Int]) -> [Int] {
    return l.map { $0 + 1 }
}
```

func incrList(l: [Int]) -> [Int] {
    return l.map { $0 + 1 }
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Return array with elements incremented by 1.
incrList(l: [1, 2, 3]) == [2, 3, 4]
incrList(l: [5, 3, 5, 2, 3, 3, 9, 0, 123]) == [6, 4, 6, 3, 4, 4, 10, 1, 124]
### Response:
```swift
func incrList(l: [Int]) -> [Int] {
    return l.map { $0 + 1 }
}
```

func incrList(l: [Int]) -> [Int] {
    return l.map { $0 + 1 }
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Return array with elements incremented by 1.
incrList(l: [1, 2, 3]) == [2, 3, 4]
incrList(l: [5, 3, 5, 2, 3, 3, 9, 0, 123]) == [6, 4, 6, 3, 4, 4, 10, 1, 124]
### Response:
```swift
func incrList(l: [Int]) -> [Int] {
    return l.map { $0 + 1 }
}
```

func incrList(l: [Int]) -> [Int] {
    return l.map { $0 + 1 }
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Return array with elements incremented by 1.
incrList(l: [1, 2, 3]) == [2, 3, 4]
incrList(l: [5, 3, 5, 2, 3, 3, 9, 0, 123]) == [6, 4, 6, 3, 4, 4, 10, 1, 124]
### Response:
```swift
func incrList(l: [Int]) -> [Int] {
    return l.map { $0 + 1 }
}
```

func incrList(l: [Int]) -> [Int] {
    return l.map { $0 + 1 }
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Return array with elements incremented by 1.
incrList(l: [1, 2, 3]) == [2, 3, 4]
incrList(l: [5, 3, 5, 2, 3, 3, 9, 0, 123]) == [6, 4, 6, 3, 4, 4, 10, 1, 124]
### Response:
```swift
func incrList(l: [Int]) -> [Int] {
    return l.map { $0 + 1 }
}
```

func incrList(l: [Int]) -> [Int] {
    return l.map { $0 + 1 }
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Return array with elements incremented by 1.
incrList(l: [1, 2, 3]) == [2, 3, 4]
incrList(l: [5, 3, 5, 2, 3, 3, 9, 0, 123]) == [6, 4, 6, 3, 4, 4, 10, 1, 124]
### Response:
```swift
func incrList(l: [Int]) -> [Int] {
    return l.map { $0 + 1 }
}
```

func incrList(l: [Int]) -> [Int] {
    return l.map { $0 + 1 }
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Return array with elements incremented by 1.
incrList(l: [1, 2, 3]) == [2, 3, 4]
incrList(l: [5, 3, 5, 2, 3, 3, 9, 0, 123]) == [6, 4, 6, 3, 4, 4, 10, 1, 124]
### Response:
```swift
func incrList(l: [Int]) -> [Int] {
    return l.map { $0 + 1 }
}
```

func incrList(l: [Int]) -> [Int] {
    return l.map { $0 + 1 }
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Return array with elements incremented by 1.
incrList(l: [1, 2, 3]) == [2, 3, 4]
incrList(l: [5, 3, 5, 2, 3, 3, 9, 0, 123]) == [6, 4, 6, 3, 4, 4, 10, 1, 124]
### Response:
```swift
func incrList(l: [Int]) -> [Int] {
    return l.map { $0 + 1 }
}
```

func incrList(l: [Int]) -> [Int] {
    return l.map { $0 + 1 }
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Return array with elements incremented by 1.
incrList(l: [1, 2, 3]) == [2, 3, 4]
incrList(l: [5, 3, 5, 2, 3, 3, 9, 0, 123]) == [6, 4, 6, 3, 4, 4, 10, 1, 124]
### Response:
```swift
func incrList(l: [Int]) -> [Int] {
    return l.map { $0 + 1 }
}
```

func pairsSumToZero(l: [Int]) -> Bool {
    var dict = [Int: Bool]()
    for i in l {
        if dict[i] != nil {
            return true
        }
        dict[i] = true
    }
    return false
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
pairs_sum_to_zero takes an array of integers as an input.
it returns true if there are two distinct elements in the array that
sum to zero, and false otherwise.
pairsSumToZero(l: [1, 3, 5, 0]) == false
pairsSumToZero(l: [1, 3, -2, 1]) == false
pairsSumToZero(l: [1, 2, 3, 7]) == false
pairsSumToZero(l: [2, 4, -5, 3, 5, 7]) == true
pairsSumToZero(l: [1]) == false
### Response:
```swift
func pairsSumToZero(l: [Int]) -> Bool {
    var dict = [Int: Bool]()
    for i in l {
        if dict[i] != nil {
            return true
        }
        dict[i] = true
    }
    return false
}
```

func pairsSumToZero(l: [Int]) -> Bool {
    var dict = [Int: Bool]()
    for i in l {
        if dict[i] == nil {
            dict[i] = true
        }
    }
    for i in l {
        let complement = -i
        if dict[complement] != nil {
            return true
        }
    }
    return false
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
pairs_sum_to_zero takes an array of integers as an input.
it returns true if there are two distinct elements in the array that
sum to zero, and false otherwise.
pairsSumToZero(l: [1, 3, 5, 0]) == false
pairsSumToZero(l: [1, 3, -2, 1]) == false
pairsSumToZero(l: [1, 2, 3, 7]) == false
pairsSumToZero(l: [2, 4, -5, 3, 5, 7]) == true
pairsSumToZero(l: [1]) == false
### Response:
```swift
func pairsSumToZero(l: [Int]) -> Bool {
    var dict = [Int: Bool]()
    for i in l {
        if dict[i] == nil {
            dict[i] = true
        }
    }
    for i in l {
        let complement = -i
        if dict[complement] != nil {
            return true
        }
    }
    return false
}
```

func pairsSumToZero(l: [Int]) -> Bool {
    var dict = [Int: Bool]()
    for i in l {
        if let _ = dict[i] {
            return true
        }
        dict[i] = true
    }
    return false
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
pairs_sum_to_zero takes an array of integers as an input.
it returns true if there are two distinct elements in the array that
sum to zero, and false otherwise.
pairsSumToZero(l: [1, 3, 5, 0]) == false
pairsSumToZero(l: [1, 3, -2, 1]) == false
pairsSumToZero(l: [1, 2, 3, 7]) == false
pairsSumToZero(l: [2, 4, -5, 3, 5, 7]) == true
pairsSumToZero(l: [1]) == false
### Response:
```swift
func pairsSumToZero(l: [Int]) -> Bool {
    var dict = [Int: Bool]()
    for i in l {
        if let _ = dict[i] {
            return true
        }
        dict[i] = true
    }
    return false
}
```

func pairsSumToZero(l: [Int]) -> Bool {
    var dict = [Int: Int]()
    for i in l {
        if let count = dict[i] {
            dict[i] = count + 1
        } else {
            dict[i] = 1
        }
    }
    for (key, value) in dict {
        if key == 0 {
            if value > 1 {
                return true
            }
        } else {
            if let count = dict[-key] {
                if count > 0 {
                    return true
                }
            }
        }
    }
    return false
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
pairs_sum_to_zero takes an array of integers as an input.
it returns true if there are two distinct elements in the array that
sum to zero, and false otherwise.
pairsSumToZero(l: [1, 3, 5, 0]) == false
pairsSumToZero(l: [1, 3, -2, 1]) == false
pairsSumToZero(l: [1, 2, 3, 7]) == false
pairsSumToZero(l: [2, 4, -5, 3, 5, 7]) == true
pairsSumToZero(l: [1]) == false
### Response:
```swift
func pairsSumToZero(l: [Int]) -> Bool {
    var dict = [Int: Int]()
    for i in l {
        if let count = dict[i] {
            dict[i] = count + 1
        } else {
            dict[i] = 1
        }
    }
    for (key, value) in dict {
        if key == 0 {
            if value > 1 {
                return true
            }
        } else {
            if let count = dict[-key] {
                if count > 0 {
                    return true
                }
            }
        }
    }
    return false
}
```

func pairsSumToZero(l: [Int]) -> Bool {
    var dict = [Int: Bool]()
    for i in l {
        if dict[i] == nil {
            dict[i] = true
        }
    }
    for i in l {
        let temp = -i
        if dict[temp] != nil {
            return true
        }
    }
    return false
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
pairs_sum_to_zero takes an array of integers as an input.
it returns true if there are two distinct elements in the array that
sum to zero, and false otherwise.
pairsSumToZero(l: [1, 3, 5, 0]) == false
pairsSumToZero(l: [1, 3, -2, 1]) == false
pairsSumToZero(l: [1, 2, 3, 7]) == false
pairsSumToZero(l: [2, 4, -5, 3, 5, 7]) == true
pairsSumToZero(l: [1]) == false
### Response:
```swift
func pairsSumToZero(l: [Int]) -> Bool {
    var dict = [Int: Bool]()
    for i in l {
        if dict[i] == nil {
            dict[i] = true
        }
    }
    for i in l {
        let temp = -i
        if dict[temp] != nil {
            return true
        }
    }
    return false
}
```

func pairsSumToZero(l: [Int]) -> Bool {
    var dict = [Int: Bool]()
    for i in l {
        if dict[i] == nil {
            dict[i] = true
        }
    }
    for i in l {
        if dict[-i] != nil {
            return true
        }
    }
    return false
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
pairs_sum_to_zero takes an array of integers as an input.
it returns true if there are two distinct elements in the array that
sum to zero, and false otherwise.
pairsSumToZero(l: [1, 3, 5, 0]) == false
pairsSumToZero(l: [1, 3, -2, 1]) == false
pairsSumToZero(l: [1, 2, 3, 7]) == false
pairsSumToZero(l: [2, 4, -5, 3, 5, 7]) == true
pairsSumToZero(l: [1]) == false
### Response:
```swift
func pairsSumToZero(l: [Int]) -> Bool {
    var dict = [Int: Bool]()
    for i in l {
        if dict[i] == nil {
            dict[i] = true
        }
    }
    for i in l {
        if dict[-i] != nil {
            return true
        }
    }
    return false
}
```

func pairsSumToZero(l: [Int]) -> Bool {
    var dict = [Int: Bool]()
    for i in l {
        if dict[i] == nil {
            dict[i] = true
        }
    }
    for i in l {
        let complement = -i
        if dict[complement] == true {
            return true
        }
    }
    return false
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
pairs_sum_to_zero takes an array of integers as an input.
it returns true if there are two distinct elements in the array that
sum to zero, and false otherwise.
pairsSumToZero(l: [1, 3, 5, 0]) == false
pairsSumToZero(l: [1, 3, -2, 1]) == false
pairsSumToZero(l: [1, 2, 3, 7]) == false
pairsSumToZero(l: [2, 4, -5, 3, 5, 7]) == true
pairsSumToZero(l: [1]) == false
### Response:
```swift
func pairsSumToZero(l: [Int]) -> Bool {
    var dict = [Int: Bool]()
    for i in l {
        if dict[i] == nil {
            dict[i] = true
        }
    }
    for i in l {
        let complement = -i
        if dict[complement] == true {
            return true
        }
    }
    return false
}
```

func pairsSumToZero(l: [Int]) -> Bool {
    var dict = [Int: Bool]()
    for i in l {
        if dict[i] == nil {
            dict[i] = true
        }
    }
    for i in l {
        if dict[-i] != nil {
            return true
        }
    }
    return false
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
pairs_sum_to_zero takes an array of integers as an input.
it returns true if there are two distinct elements in the array that
sum to zero, and false otherwise.
pairsSumToZero(l: [1, 3, 5, 0]) == false
pairsSumToZero(l: [1, 3, -2, 1]) == false
pairsSumToZero(l: [1, 2, 3, 7]) == false
pairsSumToZero(l: [2, 4, -5, 3, 5, 7]) == true
pairsSumToZero(l: [1]) == false
### Response:
```swift
func pairsSumToZero(l: [Int]) -> Bool {
    var dict = [Int: Bool]()
    for i in l {
        if dict[i] == nil {
            dict[i] = true
        }
    }
    for i in l {
        if dict[-i] != nil {
            return true
        }
    }
    return false
}
```

func pairsSumToZero(l: [Int]) -> Bool {
    var dict = [Int: Int]()
    for i in l {
        if let val = dict[i] {
            return true
        } else {
            dict[i] = 1
        }
    }
    return false
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
pairs_sum_to_zero takes an array of integers as an input.
it returns true if there are two distinct elements in the array that
sum to zero, and false otherwise.
pairsSumToZero(l: [1, 3, 5, 0]) == false
pairsSumToZero(l: [1, 3, -2, 1]) == false
pairsSumToZero(l: [1, 2, 3, 7]) == false
pairsSumToZero(l: [2, 4, -5, 3, 5, 7]) == true
pairsSumToZero(l: [1]) == false
### Response:
```swift
func pairsSumToZero(l: [Int]) -> Bool {
    var dict = [Int: Int]()
    for i in l {
        if let val = dict[i] {
            return true
        } else {
            dict[i] = 1
        }
    }
    return false
}
```

func pairsSumToZero(l: [Int]) -> Bool {
    var dict = [Int: Bool]()
    for i in l {
        if dict[i] == nil {
            dict[i] = true
        }
    }
    for i in l {
        let j = -i
        if dict[j] != nil {
            return true
        }
    }
    return false
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
pairs_sum_to_zero takes an array of integers as an input.
it returns true if there are two distinct elements in the array that
sum to zero, and false otherwise.
pairsSumToZero(l: [1, 3, 5, 0]) == false
pairsSumToZero(l: [1, 3, -2, 1]) == false
pairsSumToZero(l: [1, 2, 3, 7]) == false
pairsSumToZero(l: [2, 4, -5, 3, 5, 7]) == true
pairsSumToZero(l: [1]) == false
### Response:
```swift
func pairsSumToZero(l: [Int]) -> Bool {
    var dict = [Int: Bool]()
    for i in l {
        if dict[i] == nil {
            dict[i] = true
        }
    }
    for i in l {
        let j = -i
        if dict[j] != nil {
            return true
        }
    }
    return false
}
```

func changeBase(x: Int, base: Int) -> String {
    var result = ""
    var number = x
    while number > 0 {
        let remainder = number % base
        number = number / base
        result = "\(remainder)\(result)"
    }
    return result
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Change numerical base of input number x to base.
return string representation after the conversion.
base numbers are less than 10.
changeBase(x: 8, base: 3) == "22"
changeBase(x: 8, base: 2) == "1000"
changeBase(x: 7, base: 2) == "111"
### Response:
```swift
func changeBase(x: Int, base: Int) -> String {
    var result = ""
    var number = x
    while number > 0 {
        let remainder = number % base
        number = number / base
        result = "\(remainder)\(result)"
    }
    return result
}
```

func changeBase(x: Int, base: Int) -> String {
    var result = ""
    var number = x
    var divider = base
    while number > 0 {
        let remainder = number % divider
        result = "\(remainder)" + result
        number = number / divider
    }
    return result
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Change numerical base of input number x to base.
return string representation after the conversion.
base numbers are less than 10.
changeBase(x: 8, base: 3) == "22"
changeBase(x: 8, base: 2) == "1000"
changeBase(x: 7, base: 2) == "111"
### Response:
```swift
func changeBase(x: Int, base: Int) -> String {
    var result = ""
    var number = x
    var divider = base
    while number > 0 {
        let remainder = number % divider
        result = "\(remainder)" + result
        number = number / divider
    }
    return result
}
```

func changeBase(x: Int, base: Int) -> String {
    var result = ""
    var number = x
    while number > 0 {
        result = String(number % base) + result
        number = number / base
    }
    return result
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Change numerical base of input number x to base.
return string representation after the conversion.
base numbers are less than 10.
changeBase(x: 8, base: 3) == "22"
changeBase(x: 8, base: 2) == "1000"
changeBase(x: 7, base: 2) == "111"
### Response:
```swift
func changeBase(x: Int, base: Int) -> String {
    var result = ""
    var number = x
    while number > 0 {
        result = String(number % base) + result
        number = number / base
    }
    return result
}
```

func changeBase(x: Int, base: Int) -> String {
    var result = ""
    var number = x
    while number > 0 {
        result = String(number % base) + result
        number /= base
    }
    return result
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Change numerical base of input number x to base.
return string representation after the conversion.
base numbers are less than 10.
changeBase(x: 8, base: 3) == "22"
changeBase(x: 8, base: 2) == "1000"
changeBase(x: 7, base: 2) == "111"
### Response:
```swift
func changeBase(x: Int, base: Int) -> String {
    var result = ""
    var number = x
    while number > 0 {
        result = String(number % base) + result
        number /= base
    }
    return result
}
```

func changeBase(x: Int, base: Int) -> String {
    var result = ""
    var number = x
    var baseNumber = base
    while number > 0 {
        let remainder = number % baseNumber
        number = number / baseNumber
        result = "\(remainder)" + result
    }
    return result
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Change numerical base of input number x to base.
return string representation after the conversion.
base numbers are less than 10.
changeBase(x: 8, base: 3) == "22"
changeBase(x: 8, base: 2) == "1000"
changeBase(x: 7, base: 2) == "111"
### Response:
```swift
func changeBase(x: Int, base: Int) -> String {
    var result = ""
    var number = x
    var baseNumber = base
    while number > 0 {
        let remainder = number % baseNumber
        number = number / baseNumber
        result = "\(remainder)" + result
    }
    return result
}
```

func changeBase(x: Int, base: Int) -> String {
    var result = ""
    var num = x
    while num > 0 {
        result = String(num % base) + result
        num /= base
    }
    return result
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Change numerical base of input number x to base.
return string representation after the conversion.
base numbers are less than 10.
changeBase(x: 8, base: 3) == "22"
changeBase(x: 8, base: 2) == "1000"
changeBase(x: 7, base: 2) == "111"
### Response:
```swift
func changeBase(x: Int, base: Int) -> String {
    var result = ""
    var num = x
    while num > 0 {
        result = String(num % base) + result
        num /= base
    }
    return result
}
```

func changeBase(x: Int, base: Int) -> String {
    var result = ""
    var number = x
    var baseNum = base
    while number > 0 {
        let remainder = number % baseNum
        number = number / baseNum
        result = "\(remainder)" + result
    }
    return result
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Change numerical base of input number x to base.
return string representation after the conversion.
base numbers are less than 10.
changeBase(x: 8, base: 3) == "22"
changeBase(x: 8, base: 2) == "1000"
changeBase(x: 7, base: 2) == "111"
### Response:
```swift
func changeBase(x: Int, base: Int) -> String {
    var result = ""
    var number = x
    var baseNum = base
    while number > 0 {
        let remainder = number % baseNum
        number = number / baseNum
        result = "\(remainder)" + result
    }
    return result
}
```

func changeBase(x: Int, base: Int) -> String {
    var result = ""
    var num = x
    while num > 0 {
        result = String(num % base) + result
        num /= base
    }
    return result
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Change numerical base of input number x to base.
return string representation after the conversion.
base numbers are less than 10.
changeBase(x: 8, base: 3) == "22"
changeBase(x: 8, base: 2) == "1000"
changeBase(x: 7, base: 2) == "111"
### Response:
```swift
func changeBase(x: Int, base: Int) -> String {
    var result = ""
    var num = x
    while num > 0 {
        result = String(num % base) + result
        num /= base
    }
    return result
}
```

func changeBase(x: Int, base: Int) -> String {
    var result = ""
    var number = x
    while number > 0 {
        result = "\(number % base)" + result
        number /= base
    }
    return result
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Change numerical base of input number x to base.
return string representation after the conversion.
base numbers are less than 10.
changeBase(x: 8, base: 3) == "22"
changeBase(x: 8, base: 2) == "1000"
changeBase(x: 7, base: 2) == "111"
### Response:
```swift
func changeBase(x: Int, base: Int) -> String {
    var result = ""
    var number = x
    while number > 0 {
        result = "\(number % base)" + result
        number /= base
    }
    return result
}
```

func changeBase(x: Int, base: Int) -> String {
    var result = ""
    var number = x
    while number > 0 {
        result = String(number % base) + result
        number = number / base
    }
    return result
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Change numerical base of input number x to base.
return string representation after the conversion.
base numbers are less than 10.
changeBase(x: 8, base: 3) == "22"
changeBase(x: 8, base: 2) == "1000"
changeBase(x: 7, base: 2) == "111"
### Response:
```swift
func changeBase(x: Int, base: Int) -> String {
    var result = ""
    var number = x
    while number > 0 {
        result = String(number % base) + result
        number = number / base
    }
    return result
}
```

func triangleArea(a: Int, h: Int) -> Double {
    return Double(a * h) / 2
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Given length of a side and high return area for a triangle.
triangleArea(a: 5, h: 3) == 7.5
### Response:
```swift
func triangleArea(a: Int, h: Int) -> Double {
    return Double(a * h) / 2
}
```

func triangleArea(a: Int, h: Int) -> Double {
    return Double(a * h) / 2
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Given length of a side and high return area for a triangle.
triangleArea(a: 5, h: 3) == 7.5
### Response:
```swift
func triangleArea(a: Int, h: Int) -> Double {
    return Double(a * h) / 2
}
```

func triangleArea(a: Int, h: Int) -> Double {
    return Double(a * h) / 2
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Given length of a side and high return area for a triangle.
triangleArea(a: 5, h: 3) == 7.5
### Response:
```swift
func triangleArea(a: Int, h: Int) -> Double {
    return Double(a * h) / 2
}
```

func triangleArea(a: Int, h: Int) -> Double {
    return Double(a * h) / 2
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Given length of a side and high return area for a triangle.
triangleArea(a: 5, h: 3) == 7.5
### Response:
```swift
func triangleArea(a: Int, h: Int) -> Double {
    return Double(a * h) / 2
}
```

func triangleArea(a: Int, h: Int) -> Double {
    return Double(a * h) / 2
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Given length of a side and high return area for a triangle.
triangleArea(a: 5, h: 3) == 7.5
### Response:
```swift
func triangleArea(a: Int, h: Int) -> Double {
    return Double(a * h) / 2
}
```

func triangleArea(a: Int, h: Int) -> Double {
    return Double(a * h) / 2
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Given length of a side and high return area for a triangle.
triangleArea(a: 5, h: 3) == 7.5
### Response:
```swift
func triangleArea(a: Int, h: Int) -> Double {
    return Double(a * h) / 2
}
```

func triangleArea(a: Int, h: Int) -> Double {
    return Double(a * h) / 2
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Given length of a side and high return area for a triangle.
triangleArea(a: 5, h: 3) == 7.5
### Response:
```swift
func triangleArea(a: Int, h: Int) -> Double {
    return Double(a * h) / 2
}
```

func triangleArea(a: Int, h: Int) -> Double {
    return Double(a * h) / 2
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Given length of a side and high return area for a triangle.
triangleArea(a: 5, h: 3) == 7.5
### Response:
```swift
func triangleArea(a: Int, h: Int) -> Double {
    return Double(a * h) / 2
}
```

func triangleArea(a: Int, h: Int) -> Double {
    return Double(a * h) / 2
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Given length of a side and high return area for a triangle.
triangleArea(a: 5, h: 3) == 7.5
### Response:
```swift
func triangleArea(a: Int, h: Int) -> Double {
    return Double(a * h) / 2
}
```

func triangleArea(a: Int, h: Int) -> Double {
    return Double(a * h) / 2
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Given length of a side and high return area for a triangle.
triangleArea(a: 5, h: 3) == 7.5
### Response:
```swift
func triangleArea(a: Int, h: Int) -> Double {
    return Double(a * h) / 2
}
```

func fib4(n: Int) -> Int {
    var a = 0, b = 0, c = 2, d = 0
    for _ in 3...n {
        let e = a + b + c + d
        a = b
        b = c
        c = d
        d = e
    }
    return d
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
The Fib4 number sequence is a sequence similar to the Fibbonacci sequnece that's defined as follows:
fib4(0) -> 0
fib4(1) -> 0
fib4(2) -> 2
fib4(3) -> 0
fib4(n) -> fib4(n-1) + fib4(n-2) + fib4(n-3) + fib4(n-4).
Please write a function to efficiently compute the n-th element of the fib4 number sequence.  Do not use recursion.
fib4(n: 5) == 4
fib4(n: 6) == 8
fib4(n: 7) == 14
### Response:
```swift
func fib4(n: Int) -> Int {
    var a = 0, b = 0, c = 2, d = 0
    for _ in 3...n {
        let e = a + b + c + d
        a = b
        b = c
        c = d
        d = e
    }
    return d
}
```

func fib4(n: Int) -> Int {
    var a = 0, b = 0, c = 2, d = 0
    for _ in 3...n {
        let e = a + b + c + d
        a = b
        b = c
        c = d
        d = e
    }
    return d
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
The Fib4 number sequence is a sequence similar to the Fibbonacci sequnece that's defined as follows:
fib4(0) -> 0
fib4(1) -> 0
fib4(2) -> 2
fib4(3) -> 0
fib4(n) -> fib4(n-1) + fib4(n-2) + fib4(n-3) + fib4(n-4).
Please write a function to efficiently compute the n-th element of the fib4 number sequence.  Do not use recursion.
fib4(n: 5) == 4
fib4(n: 6) == 8
fib4(n: 7) == 14
### Response:
```swift
func fib4(n: Int) -> Int {
    var a = 0, b = 0, c = 2, d = 0
    for _ in 3...n {
        let e = a + b + c + d
        a = b
        b = c
        c = d
        d = e
    }
    return d
}
```

func fib4(n: Int) -> Int {
    if n == 0 {
        return 0
    }
    if n == 1 {
        return 0
    }
    if n == 2 {
        return 2
    }
    if n == 3 {
        return 0
    }
    var a = 0
    var b = 0
    var c = 2
    var d = 0
    var e = 0
    for _ in 3..<n {
        e = a + b + c + d
        a = b
        b = c
        c = d
        d = e
    }
    return e
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
The Fib4 number sequence is a sequence similar to the Fibbonacci sequnece that's defined as follows:
fib4(0) -> 0
fib4(1) -> 0
fib4(2) -> 2
fib4(3) -> 0
fib4(n) -> fib4(n-1) + fib4(n-2) + fib4(n-3) + fib4(n-4).
Please write a function to efficiently compute the n-th element of the fib4 number sequence.  Do not use recursion.
fib4(n: 5) == 4
fib4(n: 6) == 8
fib4(n: 7) == 14
### Response:
```swift
func fib4(n: Int) -> Int {
    if n == 0 {
        return 0
    }
    if n == 1 {
        return 0
    }
    if n == 2 {
        return 2
    }
    if n == 3 {
        return 0
    }
    var a = 0
    var b = 0
    var c = 2
    var d = 0
    var e = 0
    for _ in 3..<n {
        e = a + b + c + d
        a = b
        b = c
        c = d
        d = e
    }
    return e
}
```

func fib4(n: Int) -> Int {
    if n == 0 {
        return 0
    }
    if n == 1 {
        return 0
    }
    if n == 2 {
        return 2
    }
    if n == 3 {
        return 0
    }
    return fib4(n: n-1) + fib4(n: n-2) + fib4(n: n-3) + fib4(n: n-4)
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
The Fib4 number sequence is a sequence similar to the Fibbonacci sequnece that's defined as follows:
fib4(0) -> 0
fib4(1) -> 0
fib4(2) -> 2
fib4(3) -> 0
fib4(n) -> fib4(n-1) + fib4(n-2) + fib4(n-3) + fib4(n-4).
Please write a function to efficiently compute the n-th element of the fib4 number sequence.  Do not use recursion.
fib4(n: 5) == 4
fib4(n: 6) == 8
fib4(n: 7) == 14
### Response:
```swift
func fib4(n: Int) -> Int {
    if n == 0 {
        return 0
    }
    if n == 1 {
        return 0
    }
    if n == 2 {
        return 2
    }
    if n == 3 {
        return 0
    }
    return fib4(n: n-1) + fib4(n: n-2) + fib4(n: n-3) + fib4(n: n-4)
}
```

func fib4(n: Int) -> Int {
    var a = 0, b = 0, c = 2, d = 0
    for _ in 0..<n {
        let e = a + b + c + d
        a = b
        b = c
        c = d
        d = e
    }
    return d
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
The Fib4 number sequence is a sequence similar to the Fibbonacci sequnece that's defined as follows:
fib4(0) -> 0
fib4(1) -> 0
fib4(2) -> 2
fib4(3) -> 0
fib4(n) -> fib4(n-1) + fib4(n-2) + fib4(n-3) + fib4(n-4).
Please write a function to efficiently compute the n-th element of the fib4 number sequence.  Do not use recursion.
fib4(n: 5) == 4
fib4(n: 6) == 8
fib4(n: 7) == 14
### Response:
```swift
func fib4(n: Int) -> Int {
    var a = 0, b = 0, c = 2, d = 0
    for _ in 0..<n {
        let e = a + b + c + d
        a = b
        b = c
        c = d
        d = e
    }
    return d
}
```

func fib4(n: Int) -> Int {
    if n == 0 {
        return 0
    }
    if n == 1 {
        return 0
    }
    if n == 2 {
        return 2
    }
    if n == 3 {
        return 0
    }
    var a = 0
    var b = 0
    var c = 2
    var d = 0
    for _ in 4...n {
        let e = a + b + c + d
        a = b
        b = c
        c = d
        d = e
    }
    return d
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
The Fib4 number sequence is a sequence similar to the Fibbonacci sequnece that's defined as follows:
fib4(0) -> 0
fib4(1) -> 0
fib4(2) -> 2
fib4(3) -> 0
fib4(n) -> fib4(n-1) + fib4(n-2) + fib4(n-3) + fib4(n-4).
Please write a function to efficiently compute the n-th element of the fib4 number sequence.  Do not use recursion.
fib4(n: 5) == 4
fib4(n: 6) == 8
fib4(n: 7) == 14
### Response:
```swift
func fib4(n: Int) -> Int {
    if n == 0 {
        return 0
    }
    if n == 1 {
        return 0
    }
    if n == 2 {
        return 2
    }
    if n == 3 {
        return 0
    }
    var a = 0
    var b = 0
    var c = 2
    var d = 0
    for _ in 4...n {
        let e = a + b + c + d
        a = b
        b = c
        c = d
        d = e
    }
    return d
}
```

func fib4(n: Int) -> Int {
    var a = 0
    var b = 0
    var c = 2
    var d = 0
    var e = 0
    var f = 0
    for _ in 0..<n {
        f = a + b + c + d
        a = b
        b = c
        c = d
        d = e
        e = f
    }
    return f
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
The Fib4 number sequence is a sequence similar to the Fibbonacci sequnece that's defined as follows:
fib4(0) -> 0
fib4(1) -> 0
fib4(2) -> 2
fib4(3) -> 0
fib4(n) -> fib4(n-1) + fib4(n-2) + fib4(n-3) + fib4(n-4).
Please write a function to efficiently compute the n-th element of the fib4 number sequence.  Do not use recursion.
fib4(n: 5) == 4
fib4(n: 6) == 8
fib4(n: 7) == 14
### Response:
```swift
func fib4(n: Int) -> Int {
    var a = 0
    var b = 0
    var c = 2
    var d = 0
    var e = 0
    var f = 0
    for _ in 0..<n {
        f = a + b + c + d
        a = b
        b = c
        c = d
        d = e
        e = f
    }
    return f
}
```

func fib4(n: Int) -> Int {
    var a = 0
    var b = 0
    var c = 2
    var d = 0
    var e = 0
    var f = 0
    for _ in 0..<n {
        f = a + b + c + d
        a = b
        b = c
        c = d
        d = e
        e = f
    }
    return f
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
The Fib4 number sequence is a sequence similar to the Fibbonacci sequnece that's defined as follows:
fib4(0) -> 0
fib4(1) -> 0
fib4(2) -> 2
fib4(3) -> 0
fib4(n) -> fib4(n-1) + fib4(n-2) + fib4(n-3) + fib4(n-4).
Please write a function to efficiently compute the n-th element of the fib4 number sequence.  Do not use recursion.
fib4(n: 5) == 4
fib4(n: 6) == 8
fib4(n: 7) == 14
### Response:
```swift
func fib4(n: Int) -> Int {
    var a = 0
    var b = 0
    var c = 2
    var d = 0
    var e = 0
    var f = 0
    for _ in 0..<n {
        f = a + b + c + d
        a = b
        b = c
        c = d
        d = e
        e = f
    }
    return f
}
```

func fib4(n: Int) -> Int {
    var a = 0
    var b = 0
    var c = 2
    var d = 0
    var e = 0
    var f = 0
    for _ in 0..<n {
        f = a + b + c + d
        a = b
        b = c
        c = d
        d = e
        e = f
    }
    return f
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
The Fib4 number sequence is a sequence similar to the Fibbonacci sequnece that's defined as follows:
fib4(0) -> 0
fib4(1) -> 0
fib4(2) -> 2
fib4(3) -> 0
fib4(n) -> fib4(n-1) + fib4(n-2) + fib4(n-3) + fib4(n-4).
Please write a function to efficiently compute the n-th element of the fib4 number sequence.  Do not use recursion.
fib4(n: 5) == 4
fib4(n: 6) == 8
fib4(n: 7) == 14
### Response:
```swift
func fib4(n: Int) -> Int {
    var a = 0
    var b = 0
    var c = 2
    var d = 0
    var e = 0
    var f = 0
    for _ in 0..<n {
        f = a + b + c + d
        a = b
        b = c
        c = d
        d = e
        e = f
    }
    return f
}
```

func fib4(n: Int) -> Int {
    if n <= 2 {
        return n
    }
    var a = 0
    var b = 0
    var c = 2
    var d = 0
    for _ in 3...n {
        let temp = a
        a = b
        b = c
        c = d
        d = temp + b + c + d
    }
    return d
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
The Fib4 number sequence is a sequence similar to the Fibbonacci sequnece that's defined as follows:
fib4(0) -> 0
fib4(1) -> 0
fib4(2) -> 2
fib4(3) -> 0
fib4(n) -> fib4(n-1) + fib4(n-2) + fib4(n-3) + fib4(n-4).
Please write a function to efficiently compute the n-th element of the fib4 number sequence.  Do not use recursion.
fib4(n: 5) == 4
fib4(n: 6) == 8
fib4(n: 7) == 14
### Response:
```swift
func fib4(n: Int) -> Int {
    if n <= 2 {
        return n
    }
    var a = 0
    var b = 0
    var c = 2
    var d = 0
    for _ in 3...n {
        let temp = a
        a = b
        b = c
        c = d
        d = temp + b + c + d
    }
    return d
}
```

func median(l: [Int]) -> Double {
    let sorted = l.sorted()
    let count = l.count
    if count % 2 == 0 {
        return Double(sorted[count / 2] + sorted[count / 2 - 1]) / 2
    } else {
        return Double(sorted[count / 2])
    }
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Return median of elements in the array l.
median(l: [3, 1, 2, 4, 5]) == 3
median(l: [-10, 4, 6, 1000, 10, 20]) == 15.0
### Response:
```swift
func median(l: [Int]) -> Double {
    let sorted = l.sorted()
    let count = l.count
    if count % 2 == 0 {
        return Double(sorted[count / 2] + sorted[count / 2 - 1]) / 2
    } else {
        return Double(sorted[count / 2])
    }
}
```

func median(l: [Int]) -> Double {
    let sorted = l.sorted()
    let count = l.count
    if count % 2 == 0 {
        return Double(sorted[count / 2] + sorted[count / 2 - 1]) / 2
    } else {
        return Double(sorted[count / 2])
    }
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Return median of elements in the array l.
median(l: [3, 1, 2, 4, 5]) == 3
median(l: [-10, 4, 6, 1000, 10, 20]) == 15.0
### Response:
```swift
func median(l: [Int]) -> Double {
    let sorted = l.sorted()
    let count = l.count
    if count % 2 == 0 {
        return Double(sorted[count / 2] + sorted[count / 2 - 1]) / 2
    } else {
        return Double(sorted[count / 2])
    }
}
```

func median(l: [Int]) -> Double {
    let sorted = l.sorted()
    let count = l.count
    if count % 2 == 0 {
        return Double(sorted[count / 2 - 1] + sorted[count / 2]) / 2
    } else {
        return Double(sorted[count / 2])
    }
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Return median of elements in the array l.
median(l: [3, 1, 2, 4, 5]) == 3
median(l: [-10, 4, 6, 1000, 10, 20]) == 15.0
### Response:
```swift
func median(l: [Int]) -> Double {
    let sorted = l.sorted()
    let count = l.count
    if count % 2 == 0 {
        return Double(sorted[count / 2 - 1] + sorted[count / 2]) / 2
    } else {
        return Double(sorted[count / 2])
    }
}
```

func median(l: [Int]) -> Double {
    let sorted = l.sorted()
    let count = l.count
    if count % 2 == 0 {
        return Double(sorted[count / 2] + sorted[count / 2 - 1]) / 2
    } else {
        return Double(sorted[count / 2])
    }
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Return median of elements in the array l.
median(l: [3, 1, 2, 4, 5]) == 3
median(l: [-10, 4, 6, 1000, 10, 20]) == 15.0
### Response:
```swift
func median(l: [Int]) -> Double {
    let sorted = l.sorted()
    let count = l.count
    if count % 2 == 0 {
        return Double(sorted[count / 2] + sorted[count / 2 - 1]) / 2
    } else {
        return Double(sorted[count / 2])
    }
}
```

func median(l: [Int]) -> Double {
    let sorted = l.sorted()
    let count = l.count
    if count % 2 == 0 {
        return Double(sorted[count / 2] + sorted[count / 2 - 1]) / 2
    } else {
        return Double(sorted[count / 2])
    }
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Return median of elements in the array l.
median(l: [3, 1, 2, 4, 5]) == 3
median(l: [-10, 4, 6, 1000, 10, 20]) == 15.0
### Response:
```swift
func median(l: [Int]) -> Double {
    let sorted = l.sorted()
    let count = l.count
    if count % 2 == 0 {
        return Double(sorted[count / 2] + sorted[count / 2 - 1]) / 2
    } else {
        return Double(sorted[count / 2])
    }
}
```

func median(l: [Int]) -> Double {
    let sorted = l.sorted()
    let middle = sorted.count / 2
    if sorted.count % 2 == 0 {
        return Double(sorted[middle] + sorted[middle - 1]) / 2
    } else {
        return Double(sorted[middle])
    }
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Return median of elements in the array l.
median(l: [3, 1, 2, 4, 5]) == 3
median(l: [-10, 4, 6, 1000, 10, 20]) == 15.0
### Response:
```swift
func median(l: [Int]) -> Double {
    let sorted = l.sorted()
    let middle = sorted.count / 2
    if sorted.count % 2 == 0 {
        return Double(sorted[middle] + sorted[middle - 1]) / 2
    } else {
        return Double(sorted[middle])
    }
}
```

func median(l: [Int]) -> Double {
    let sorted = l.sorted()
    let count = l.count
    if count % 2 == 0 {
        return Double(sorted[count / 2] + sorted[count / 2 - 1]) / 2
    } else {
        return Double(sorted[count / 2])
    }
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Return median of elements in the array l.
median(l: [3, 1, 2, 4, 5]) == 3
median(l: [-10, 4, 6, 1000, 10, 20]) == 15.0
### Response:
```swift
func median(l: [Int]) -> Double {
    let sorted = l.sorted()
    let count = l.count
    if count % 2 == 0 {
        return Double(sorted[count / 2] + sorted[count / 2 - 1]) / 2
    } else {
        return Double(sorted[count / 2])
    }
}
```

func median(l: [Int]) -> Double {
    let sorted = l.sorted()
    let count = l.count
    if count % 2 == 0 {
        return Double(sorted[count / 2] + sorted[count / 2 - 1]) / 2
    } else {
        return Double(sorted[count / 2])
    }
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Return median of elements in the array l.
median(l: [3, 1, 2, 4, 5]) == 3
median(l: [-10, 4, 6, 1000, 10, 20]) == 15.0
### Response:
```swift
func median(l: [Int]) -> Double {
    let sorted = l.sorted()
    let count = l.count
    if count % 2 == 0 {
        return Double(sorted[count / 2] + sorted[count / 2 - 1]) / 2
    } else {
        return Double(sorted[count / 2])
    }
}
```

func median(l: [Int]) -> Double {
    let sorted = l.sorted()
    let count = l.count
    if count % 2 == 0 {
        return Double(sorted[count / 2 - 1] + sorted[count / 2]) / 2
    } else {
        return Double(sorted[count / 2])
    }
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Return median of elements in the array l.
median(l: [3, 1, 2, 4, 5]) == 3
median(l: [-10, 4, 6, 1000, 10, 20]) == 15.0
### Response:
```swift
func median(l: [Int]) -> Double {
    let sorted = l.sorted()
    let count = l.count
    if count % 2 == 0 {
        return Double(sorted[count / 2 - 1] + sorted[count / 2]) / 2
    } else {
        return Double(sorted[count / 2])
    }
}
```

func median(l: [Int]) -> Double {
    let sorted = l.sorted()
    let count = l.count
    if count % 2 == 0 {
        return Double(sorted[count / 2] + sorted[count / 2 - 1]) / 2
    } else {
        return Double(sorted[count / 2])
    }
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Return median of elements in the array l.
median(l: [3, 1, 2, 4, 5]) == 3
median(l: [-10, 4, 6, 1000, 10, 20]) == 15.0
### Response:
```swift
func median(l: [Int]) -> Double {
    let sorted = l.sorted()
    let count = l.count
    if count % 2 == 0 {
        return Double(sorted[count / 2] + sorted[count / 2 - 1]) / 2
    } else {
        return Double(sorted[count / 2])
    }
}
```

func isPalindrome(text: String) -> Bool {
    let text = text.lowercased()
    let textArray = text.characters.map { String($0) }
    let textArrayReversed = textArray.reversed()
    return textArray == textArrayReversed
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Checks if given string is a palindrome
isPalindrome(text: "") == true
isPalindrome(text: "aba") == true
isPalindrome(text: "aaaaa") == true
isPalindrome(text: "zbcd") == false
### Response:
```swift
func isPalindrome(text: String) -> Bool {
    let text = text.lowercased()
    let textArray = text.characters.map { String($0) }
    let textArrayReversed = textArray.reversed()
    return textArray == textArrayReversed
}
```

func isPalindrome(text: String) -> Bool {
    return text == String(text.reversed())
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Checks if given string is a palindrome
isPalindrome(text: "") == true
isPalindrome(text: "aba") == true
isPalindrome(text: "aaaaa") == true
isPalindrome(text: "zbcd") == false
### Response:
```swift
func isPalindrome(text: String) -> Bool {
    return text == String(text.reversed())
}
```

func isPalindrome(text: String) -> Bool {
    return text == String(text.reversed())
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Checks if given string is a palindrome
isPalindrome(text: "") == true
isPalindrome(text: "aba") == true
isPalindrome(text: "aaaaa") == true
isPalindrome(text: "zbcd") == false
### Response:
```swift
func isPalindrome(text: String) -> Bool {
    return text == String(text.reversed())
}
```

func isPalindrome(text: String) -> Bool {
    return text.lowercased().filter { $0.isLetter } == String(text.lowercased().filter { $0.isLetter }.reversed())
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Checks if given string is a palindrome
isPalindrome(text: "") == true
isPalindrome(text: "aba") == true
isPalindrome(text: "aaaaa") == true
isPalindrome(text: "zbcd") == false
### Response:
```swift
func isPalindrome(text: String) -> Bool {
    return text.lowercased().filter { $0.isLetter } == String(text.lowercased().filter { $0.isLetter }.reversed())
}
```

func isPalindrome(text: String) -> Bool {
    let text = text.lowercased()
    let textArray = Array(text)
    let textArrayReversed = textArray.reversed()
    return textArray == textArrayReversed
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Checks if given string is a palindrome
isPalindrome(text: "") == true
isPalindrome(text: "aba") == true
isPalindrome(text: "aaaaa") == true
isPalindrome(text: "zbcd") == false
### Response:
```swift
func isPalindrome(text: String) -> Bool {
    let text = text.lowercased()
    let textArray = Array(text)
    let textArrayReversed = textArray.reversed()
    return textArray == textArrayReversed
}
```

func isPalindrome(text: String) -> Bool {
    return text.lowercased().filter { $0.isLetter } == String(text.lowercased().filter { $0.isLetter }.reversed())
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Checks if given string is a palindrome
isPalindrome(text: "") == true
isPalindrome(text: "aba") == true
isPalindrome(text: "aaaaa") == true
isPalindrome(text: "zbcd") == false
### Response:
```swift
func isPalindrome(text: String) -> Bool {
    return text.lowercased().filter { $0.isLetter } == String(text.lowercased().filter { $0.isLetter }.reversed())
}
```

func isPalindrome(text: String) -> Bool {
    return text.lowercased().filter { $0.isLetter } == String(text.lowercased().filter { $0.isLetter }.reversed())
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Checks if given string is a palindrome
isPalindrome(text: "") == true
isPalindrome(text: "aba") == true
isPalindrome(text: "aaaaa") == true
isPalindrome(text: "zbcd") == false
### Response:
```swift
func isPalindrome(text: String) -> Bool {
    return text.lowercased().filter { $0.isLetter } == String(text.lowercased().filter { $0.isLetter }.reversed())
}
```

func isPalindrome(text: String) -> Bool {
    return text.lowercased().filter { $0.isLetter } == String(text.lowercased().filter { $0.isLetter }.reversed())
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Checks if given string is a palindrome
isPalindrome(text: "") == true
isPalindrome(text: "aba") == true
isPalindrome(text: "aaaaa") == true
isPalindrome(text: "zbcd") == false
### Response:
```swift
func isPalindrome(text: String) -> Bool {
    return text.lowercased().filter { $0.isLetter } == String(text.lowercased().filter { $0.isLetter }.reversed())
}
```

func isPalindrome(text: String) -> Bool {
    return text == String(text.reversed())
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Checks if given string is a palindrome
isPalindrome(text: "") == true
isPalindrome(text: "aba") == true
isPalindrome(text: "aaaaa") == true
isPalindrome(text: "zbcd") == false
### Response:
```swift
func isPalindrome(text: String) -> Bool {
    return text == String(text.reversed())
}
```

func isPalindrome(text: String) -> Bool {
    return text.lowercased().filter { $0.isLetter } == String(text.lowercased().filter { $0.isLetter }.reversed())
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Checks if given string is a palindrome
isPalindrome(text: "") == true
isPalindrome(text: "aba") == true
isPalindrome(text: "aaaaa") == true
isPalindrome(text: "zbcd") == false
### Response:
```swift
func isPalindrome(text: String) -> Bool {
    return text.lowercased().filter { $0.isLetter } == String(text.lowercased().filter { $0.isLetter }.reversed())
}
```

func modp(n: Int, p: Int) -> Int {
    return n % p
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Return 2^n modulo p (be aware of numerics).
modp(n: 3, p: 5) == 3
modp(n: 1101, p: 101) == 2
modp(n: 0, p: 101) == 1
modp(n: 3, p: 11) == 8
modp(n: 100, p: 101) == 1
### Response:
```swift
func modp(n: Int, p: Int) -> Int {
    return n % p
}
```

func modp(n: Int, p: Int) -> Int {
    var result = 1
    var n = n
    while n > 0 {
        if n % 2 == 1 {
            result = (result * 2) % p
        }
        n = n / 2
    }
    return result
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Return 2^n modulo p (be aware of numerics).
modp(n: 3, p: 5) == 3
modp(n: 1101, p: 101) == 2
modp(n: 0, p: 101) == 1
modp(n: 3, p: 11) == 8
modp(n: 100, p: 101) == 1
### Response:
```swift
func modp(n: Int, p: Int) -> Int {
    var result = 1
    var n = n
    while n > 0 {
        if n % 2 == 1 {
            result = (result * 2) % p
        }
        n = n / 2
    }
    return result
}
```

func modp(n: Int, p: Int) -> Int {
    var result = 1
    var n = n
    while n > 0 {
        if n % 2 == 1 {
            result = (result * 2) % p
        }
        n /= 2
    }
    return result
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Return 2^n modulo p (be aware of numerics).
modp(n: 3, p: 5) == 3
modp(n: 1101, p: 101) == 2
modp(n: 0, p: 101) == 1
modp(n: 3, p: 11) == 8
modp(n: 100, p: 101) == 1
### Response:
```swift
func modp(n: Int, p: Int) -> Int {
    var result = 1
    var n = n
    while n > 0 {
        if n % 2 == 1 {
            result = (result * 2) % p
        }
        n /= 2
    }
    return result
}
```

func modp(n: Int, p: Int) -> Int {
    var n = n
    var p = p
    if n < 0 {
        n = -n
    }
    if p < 0 {
        p = -p
    }
    if n == 0 {
        return 0
    }
    if p == 1 {
        return 0
    }
    if n == 1 {
        return 1
    }
    var result = 1
    while n > 0 {
        if n % 2 == 1 {
            result = (result * p) % p
        }
        n /= 2
        p = (p * p) % p
    }
    return result
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Return 2^n modulo p (be aware of numerics).
modp(n: 3, p: 5) == 3
modp(n: 1101, p: 101) == 2
modp(n: 0, p: 101) == 1
modp(n: 3, p: 11) == 8
modp(n: 100, p: 101) == 1
### Response:
```swift
func modp(n: Int, p: Int) -> Int {
    var n = n
    var p = p
    if n < 0 {
        n = -n
    }
    if p < 0 {
        p = -p
    }
    if n == 0 {
        return 0
    }
    if p == 1 {
        return 0
    }
    if n == 1 {
        return 1
    }
    var result = 1
    while n > 0 {
        if n % 2 == 1 {
            result = (result * p) % p
        }
        n /= 2
        p = (p * p) % p
    }
    return result
}
```

func modp(n: Int, p: Int) -> Int {
    var result = 1
    var n = n
    while n > 0 {
        if n % 2 == 1 {
            result = (result * 2) % p
        }
        n /= 2
    }
    return result
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Return 2^n modulo p (be aware of numerics).
modp(n: 3, p: 5) == 3
modp(n: 1101, p: 101) == 2
modp(n: 0, p: 101) == 1
modp(n: 3, p: 11) == 8
modp(n: 100, p: 101) == 1
### Response:
```swift
func modp(n: Int, p: Int) -> Int {
    var result = 1
    var n = n
    while n > 0 {
        if n % 2 == 1 {
            result = (result * 2) % p
        }
        n /= 2
    }
    return result
}
```

func modp(n: Int, p: Int) -> Int {
    var n = n
    var p = p
    if n < 0 {
        n = -n
    }
    if p < 0 {
        p = -p
    }
    if n == 0 {
        return 0
    }
    if p == 1 {
        return 0
    }
    var result = 1
    while n > 0 {
        if n % 2 == 1 {
            result = (result * p) % p
        }
        n /= 2
        p = (p * p) % p
    }
    return result
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Return 2^n modulo p (be aware of numerics).
modp(n: 3, p: 5) == 3
modp(n: 1101, p: 101) == 2
modp(n: 0, p: 101) == 1
modp(n: 3, p: 11) == 8
modp(n: 100, p: 101) == 1
### Response:
```swift
func modp(n: Int, p: Int) -> Int {
    var n = n
    var p = p
    if n < 0 {
        n = -n
    }
    if p < 0 {
        p = -p
    }
    if n == 0 {
        return 0
    }
    if p == 1 {
        return 0
    }
    var result = 1
    while n > 0 {
        if n % 2 == 1 {
            result = (result * p) % p
        }
        n /= 2
        p = (p * p) % p
    }
    return result
}
```

func modp(n: Int, p: Int) -> Int {
    var result = 1
    var n = n
    while n > 0 {
        if n % 2 == 1 {
            result = (result * 2) % p
        }
        n /= 2
    }
    return result
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Return 2^n modulo p (be aware of numerics).
modp(n: 3, p: 5) == 3
modp(n: 1101, p: 101) == 2
modp(n: 0, p: 101) == 1
modp(n: 3, p: 11) == 8
modp(n: 100, p: 101) == 1
### Response:
```swift
func modp(n: Int, p: Int) -> Int {
    var result = 1
    var n = n
    while n > 0 {
        if n % 2 == 1 {
            result = (result * 2) % p
        }
        n /= 2
    }
    return result
}
```

func modp(n: Int, p: Int) -> Int {
    var result = 1
    var n = n
    while n > 0 {
        if n % 2 == 1 {
            result = (result * 2) % p
        }
        n /= 2
    }
    return result
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Return 2^n modulo p (be aware of numerics).
modp(n: 3, p: 5) == 3
modp(n: 1101, p: 101) == 2
modp(n: 0, p: 101) == 1
modp(n: 3, p: 11) == 8
modp(n: 100, p: 101) == 1
### Response:
```swift
func modp(n: Int, p: Int) -> Int {
    var result = 1
    var n = n
    while n > 0 {
        if n % 2 == 1 {
            result = (result * 2) % p
        }
        n /= 2
    }
    return result
}
```

func modp(n: Int, p: Int) -> Int {
    return (1 << n) % p
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Return 2^n modulo p (be aware of numerics).
modp(n: 3, p: 5) == 3
modp(n: 1101, p: 101) == 2
modp(n: 0, p: 101) == 1
modp(n: 3, p: 11) == 8
modp(n: 100, p: 101) == 1
### Response:
```swift
func modp(n: Int, p: Int) -> Int {
    return (1 << n) % p
}
```

func modp(n: Int, p: Int) -> Int {
    return (1 << n) % p
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
Return 2^n modulo p (be aware of numerics).
modp(n: 3, p: 5) == 3
modp(n: 1101, p: 101) == 2
modp(n: 0, p: 101) == 1
modp(n: 3, p: 11) == 8
modp(n: 100, p: 101) == 1
### Response:
```swift
func modp(n: Int, p: Int) -> Int {
    return (1 << n) % p
}
```

func removeVowels(text: String) -> String {
    let vowels = ["a", "e", "i", "o", "u"]
    return text.filter { !vowels.contains($0) }
}

### Instruction:
Write code in Swift programming language. Don't include usage examples or tests.
remove_vowels is a function that takes string and returns string without vowels.
removeVowels(text: "") == ""
removeVowels(text: "abcdef") == "bcdf"
removeVowels(text: "aaaaa") == ""
removeVowels(text: "aaBAA") == "B"
removeVowels(text: "zbcd") == "zbcd"
### Response:
```swift
func removeVowels(text: String) -> String {
    let vowels = ["a", "e", "i", "o", "u"]
    return text.filter { !vowels.contains($0) }
}
```