Phone Interview - Got a call through initial screening at the career fair at my university. The interviewer just asked 1 coding question - given a string of a's b's and c's which can come in any order any number of times, reduce the string to a string in which every combination of two different characters will be replaced by the third one (ab will become c, bc a, cb a, ...). Keep on doing this tip possible. Mind the fact that in place and new string will give separate answers, you can choose any approach. e.g. aabbcc becomes bb ( aabbcc -> acac -> bb)