ilyarmnzhdn

// My Swift-y solution 28ms

func numJewelsInStones(_ J: String, _ S: String) -> Int {
    var resultDict = [Character: Int]()

    for element in Array(J) {
        resultDict[element] = 0
    }

    for element in Array(S) {

ilyarmnzhdn

let dictMap: [Character: String] = [
    "a":".-",
    "b":"-...",
    "c":"-.-.",
    "d": "-..",
    "e":".",
    "f":"..-.",
    "g":"--.",
    "h":"....",
    "i":"..",

ilyarmnzhdn

extension Character {
    var isVowel: Bool { return ["a","e","i","o","u","A","E","I","O","U"].contains(self) }
}

func reverseVowel(s: String) -> String {
    if s.count == 0 { return "" }
    var characters = [Character]()
    var reversedString = ""
    s.forEach { vowel in
        if vowel.isVowel {

ilyarmnzhdn

import XCTest
@testable import InterviewQuestion2

class InterviewQuestion2Tests: XCTestCase {
    
    func sumOfDigits(for number: Int) -> Int {
      let arrayOfDigits = Array(sequence(state: number, next: { return $0 > 0 ? ($0 % 10, $0 = $0 / 10).0 : nil }))
      return arrayOfDigits.reduce(0, {$0 + $1})
    }
    

ilyarmnzhdn

import XCTest
@testable import InterviewQuestion1

class InterviewQuestion1Tests: XCTestCase {
    
   func addition(left: String, right: String) -> String {
    guard left != "" || right != "" else {
        return "Enter a correct number"
    }
    let leftDigitsArray = left.reversed().map { Int(String($0))! }

ilyarmnzhdn

func findLongestWord(word: String) -> String {
    let wordArray = word.components(separatedBy: " ")
    var maxLength = 0
    
    for index in 0..<(wordArray.count) {
        if wordArray[index].count > maxLength {
            maxLength = wordArray[index].count
        }
    }
    

ilyarmnzhdn

func factorialize(number: Int) -> Int {
    if (number == 0) { return 1 }
    return (number * factorialize(number: number - 1))
}

factorialize(number: 6)