import Foundation func solution(_ s1:[String], _ s2:[String]) -> Int { return s1.filter { s2.contains($0) }.count }

import Foundation func solution(_ numbers:[Int], _ direction:String) -> [Int] { var numbers = numbers if direction == "right" { let element = numbers.removeLast() numbers.insert(element, at: 0) } else { let element = numbers.removeFirst() numbers.append(element) } return numbers }

import Foundation func solution(_ numbers:[Int], _ num1:Int, _ num2:Int) -> [Int] { return Array(numbers[num1...num2]) }

import Foundation func solution(_ strlist:[String]) -> [Int] { return strlist.map { $0.count } }

import Foundation func solution(_ num_list:[Int]) -> [Int] { return num_list.reversed() }

import Foundation func solution(_ numbers:[Int]) -> [Int] { return numbers.map{$0 * 2} }

import Foundation func solution(_ my_string:String) -> String { return String(my_string.reversed()) }

import Foundation func solution(_ my_string:String) -> String { my_string.map { String($0).lowercased() }.sorted().joined() }

import Foundation func solution(_ my_string:String) -> [Int] { return my_string.compactMap { Int(String($0)) }.sorted() }