GitHub PushEvent at 2014-05-10 18:22:02
Repository: CodeExercises
Actor: jasonj
Payload: {"shas":[["3db0a492cdba48b27881743a0666613f99e82ef3","4127f55b08a902b2e1686acbf196fc5c915573e1@me.com","Addition of hasAnagrams exercise\n\nGiven an array of string, determine if any of the strings are anagrams\nof each other. Return should be a boolean, true if anagrams are found,\nfalse if not.","Jason Johnson",true],["6624867ae1b66d81b13a3c36d62029abdcd540f4","4127f55b08a902b2e1686acbf196fc5c915573e1@me.com","Addition of oneEditApart exercise\n\nImplement a function OneEditApart with the following signature:\nbool OneEditApart(string s1, string s2)\n\nOneEditApart(\"cat\", \"dog\") = false\nOneEditApart(\"cat\", \"cats\") = true\nOneEditApart(\"cat\", \"cut\") = true\nOneEditApart(\"cat\", \"cast\") = true\nOneEditApart(\"cat\", \"at\") = true\nOneEditApart(\"cat\", \"acts\") = false\nEdits include: insertion, removal, replacement","Jason Johnson",true],["c76fe30d323b3f8e525d8ff1d532c4f97452cd95","4127f55b08a902b2e1686acbf196fc5c915573e1@me.com","Addition of phoneToText exercise\n\nGiven the following hashmap for numeric to alpha translation of a\ntelephone keypad:\n[...]\n\nWrite a method that takes a phone number as input and returns all\npossible letter combinations for that phone number.","Jason Johnson",true]],"size":3,"ref":"refs/heads/master","head":"c76fe30d323b3f8e525d8ff1d532c4f97452cd95"}