I applied online via Google's career portal.

A few weeks after, I was contacted by email to schedule two 45-minute technical interviews with two different interviewers.

We talked by phone (1st interview) and Google Hangouts (2nd), and I had to write code in a Google Docs document.

I basically screwed up the second interview, so I obviously received no offer.

Definition: We say that two words are rotationally equivalent if there exists an integer such that adding this integer to every character of the first word gives the second word.

Example:

• "a" and "b" are rotationally equivalent (adding 1 to "a" gives "b").
• "abcd" and "cdef" are rotationally equivalent (adding 2 to each character gives "cdef").

Question: Given a list of strings, group them by if they are rotationally equivalent.

Example: ["a", "b", "cdef", "wtf", "abcd"] -> [["a", "b"], ["wtf"], ["cdef", "abcd"]]

Write a function that prints out the possibilities of an input string, with the following rules:

• {a, b, c} can be a, b, or c.
• a{a, b, c}d can be aad, abd, or acd.
• etc.

So, for instance: {a, {b, c}}d{e, f} should output:

• ade
• adf
• bde
• bdf
• cde
• cdf