import Foundation func solution(_ numbers:[Int]) -> String { let result = numbers.map { String($0) }.sorted { $0+$1 > $1+$0 }.joined() return result.first == "0" ? "0" : result }

func solution(_ msg:String) -> [Int] { var i = 0 var str = "" var msg = Array(msg) var result = [Int]() var dict: [String: Int] = ["A": 1, "B": 2, "C": 3, "D": 4, "E": 5, "F": 6, "G": 7, "H": 8, "I": 9, "J": 10, "K": 11, "L": 12, "M": 13, "N": 14, "O": 15, "P": 16, "Q": 17, "R": 18, "S": 19, "T": 20, "U": 21, "V": 22, "W": 23, "X": 24, "Y": 25, "Z": 26] while i < msg.count { let c = String(msg[i..

func solution(_ cacheSize:Int, _ cities:[String]) -> Int { var time = 0 var cache = [String]() var cities = cities.map { $0.lowercased() } for city in cities { if cache.contains(city) { time += 1 cache.remove(at: cache.firstIndex(of: city)!) cache.append(city) } else { time += 5 cache.append(city) if cache.count > cacheSize { cache.removeFirst() } } } return time }

import Foundation func solution(_ array:[Int]) -> Int { return array.sorted()[array.count/2] }

import Foundation func solution(_ array:[Int], _ n:Int) -> Int { return array.filter { $0 == n }.count }

import Foundation func solution(_ my_string:String) -> String { var result = "" my_string.forEach { if !result.contains($0) { result += String($0) } } return result }

import Foundation func solution(_ box:[Int], _ n:Int) -> Int { box.map { $0 / n }.reduce(1, *) }

import Foundation func solution(_ M:Int, _ N:Int) -> Int { return M * N - 1 }