 }
 
 isUnique("hello")
+
 
 
 

//mostCommonLetter("heellloe")


/*
adding / multiplying / traversing multi dimensional arrays
caesar cypher
tic tac toe
Check to see if string is balanced (())
Given three numbers return the median
Fibonacci - given an idx return the fib value at idx
given a jumble: String and knownWords: [String] return list of potential words that the string may be.
given a string, return the letter that appears most frequently

Given two int arrays v1 and v2 return 1 if  v1 is greater  -1 if v2 is greater and 0 if they are equal. V1 and V2 are like software versions

Given two numbers add them up and return an array or string version of the result ie: 5 + 12 = [1,7] or “17”

how many golf balls could you fit in a school bus?

Given an amount of money to convert to change. Write an algorithm that returns the optimal arrangement of change, that is, an array with the values of the coins returned to the user. The optimal array contains the least number of coins needed for the arrangement (think vending machine).

You are given an unsorted array containing the numbers 1-100 inclusive and one additional random number.  Find the value of that number

Given an array of integers, determine if the array is in sorted order.

Sort an algorithm in n^2 time.  Attempt to write the algorithm from scratch

Sort an algorithm in nlog(n) time.  Attempt to write the algorithm from scratch

Given a non-negative int n, return the sum of its digits recursively (no loops). Note that mod (%) by 10 yields the rightmost digit (126 % 10 is 6), while divide (/) by 10 removes the rightmost digit (126 / 10 is 12).  (from http://codingbat.com/prob/p163932)

Given two arrays of integers, compute the pair of values (one value in each array) with the smallest (non-negative) difference.  Return the difference. (from Cracking the Coding Interview p. 181)

EXAMPLE:
Input:{1,3,15,11,2},{23,127,235,19,8}
Output: 3 (because 11-8=3)

Design an algorithm to identify if a player has won a game of tic-tac-toe (from Cracking the Coding Interview p. 181)


*/









        
        lowestAndHighest.append(lowest) // append at index 0
        lowestAndHighest.insert(highest, atIndex: lowestAndHighest.endIndex) // append at index 1
    }
    return lowestAndHighest
}
findMinAndMax([5, 3, 7, 9, 21, 2])
