Worst interview I've ever had. The interviewer had a very thick accent, and the simple problem was purposely conveyed in the most convoluted way possible. The phone line they were using did not have a great connection.

It took me 30 minutes just to understand what she was talking about. Even after that, I still got the problem mostly correct (except for one small error), and then was told it was "totally wrong." This indicates that Facebook interviewers are poorly trained, arrogant, and encouraged to needlessly complicate interview problems.

I would never interview with them again. But whatever, I would have accepted the offer I got from Google anyway.

Ensure that there are a minimum of n dashes between any two of the same characters of a string.

Example: n = 2, string = "ab-bcdecca" -> "ab--bcdec--ca"

(This is a simple problem, though it was expressed using a complicated event system.)