Coding challenge was 3 questions. First 2 were super easy, not much to say. The 3rd question was, given 3 integers that represent the amount of As Bs and Cs you can use to construct a string, return the length of the longest possible string such that this string does not have any sequence of 3 numbers being all the same. For example, if I had the input 3,0,0, meaning 3 As, 0 Bs, 0 Cs, I would return 2 (for AA. AAA would not work, because there is a substring in this string of length 3 such that they are all the same).
