import Foundation func solution(_ n:Int) -> Int { let sqr = Int(sqrt(Double(n))) return sqr * sqr == n ? 1 : 2 }

import Foundation func solution(_ n:Int) -> Int { var result = 0 var n = n while n > 0 { result += 1 n -= 1 if result % 3 == 0 || String(result).contains("3") { n += 1 } } return result }

import Foundation func solution(_ my_str:String, _ n:Int) -> [String] { let my_str = Array(my_str) var result = [String]() for i in stride(from: 0, to: my_str.count, by: n) { let j = i + n - 1 j < my_str.count ? result.append(my_str[i...j].reduce("") {$0 + String($1)}) : result.append(my_str[i...my_str.count - 1].reduce("") {$0 + String($1)}) } return result }

import Foundation func solution(_ n:Int) -> Int { return Array(String(n)).map { Int(String($0))! }.reduce(0, +) }

func solution(_ myString: String, _ num1: Int, _ num2: Int) -> String { var array = ArraySlice(myString) array.swapAt(num1, num2) return array.map { String($0) }.joined() }

import Foundation func solution(_ bin1:String, _ bin2:String) -> String { return String(Int(bin1, radix: 2) + Int(bin2, radix: 2), radix: 2) }

import Foundation func gcd(_ a: Int, _ b: Int) -> Int { if b == 0 { return a } else { return gcd (b, a % b) } } func primefactor(_ n:Int) -> Set { 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 result } func solution(_ a:Int, _ b:Int) -> Int { let gcdAB = gcd(a,b) let a = a / gcdAB let b = b / gcdAB..

import Foundation func solution(_ age:Int) -> String { String(age).map { String(UnicodeScalar(97 + Int(String($0))!)!) }.joined() }