import Foundation func solution(_ board:[[Int]]) -> Int { var results: [[Int]] = Array(repeating: Array(repeating: 0, count: board.count), count: board.count) for (i,first) in board.enumerated() { for (j,second) in first.enumerated() { if board[i][j] == 1 { for x in i-1...i+1 { for y in j-1...j+1{ if 0

import Foundation func solution(_ money:Int) -> [Int] { return [money / 5500, money % 5500] }

import Foundation func solution(_ num:Int, _ k:Int) -> Int { return Array("_\(num)").firstIndex(of: Character("\(k)")) ?? -1 }

import Foundation func solution(_ num1:Int, _ num2:Int) -> Int { return num1 == num2 ? 1 : -1 }

import Foundation func solution(_ my_string:String) -> Int { return my_string.map { $0.isNumber ? String($0) : " " }.joined().components(separatedBy: " ").map { Int(String($0)) ?? 0 }.reduce(0, +) }

import Foundation func solution(_ my_string:String) -> Int { return my_string.compactMap { Int(String($0)) }.reduce(0, +) }

import Foundation func solution(_ n:Int) -> Int { return (1...n).filter{ n % $0 == 0}.count }

import Foundation func solution(_ n:Int) -> [Int] { var n = n var prime = 2 var result = Set() while n >= prime { if n % prime == 0 { n /= prime result.insert(prime) } else { prime += 1 } } return Array(result).sorted() }