The future is bright, the future is fun -ctional
Scala CollectionsThe beginning of a beautiful friendship
Google Code Jam ExerciseProblem The aim of this task is to translate a language into a new language called Googlerese. To translate we take any message and replace each English le<er with another English le<er. This mapping is one-‐to-‐one and onto, which means that the same input le<er always gets replaced with the same output le<er, and diﬀerent input le<ers always get replaced with diﬀerent output le<ers. A le<er may be replaced by itself. Spaces are leC as-‐is. For example (and here is a hint!), the translaIon algorithm includes the following three mappings: a -‐> y, o -‐> e, and z -‐> q. This means that "a zoo" will become "y qee". Sample Input/Output Input: Case #1: ejp mysljylc kd kxveddknmc re jsicpdrysi Case #2: rbcpc ypc rtcsra dkh wyfrepkym veddknkmkrkcd Case #3: de kr kd eoya kw aej tysr re ujdr lkgc jv" Output: Case #1: our language is impossible to understand Case #2: there are twenty six factorial possibilities Case #3: so it is okay if you want to just give up"