I applied online without any referrer. After approximately two weeks, they contacted me to schedule a phone interview. I selected my preferred time slot on their site.

The interview lasted for one hour. Initially, the interviewer asked typical questions such as "Why Bloomberg?" and "What was the hardest problem you solved during your last project?"

After that, I was asked to solve a medium-difficulty task. Then, I was questioned about technologies, including "What happens if we reach the end of a non-void function without a return statement in C++?", "What is a vector? What is the time complexity of push_back and why?", and "What is stack memory? Can you name the difference between it and other types of memory?"

I enjoyed this interview. Although it was my first interview experience, I believe I can discern the difference between a bad and a good interview.

You have an alphabet with a unique set of characters, but because this alphabet is difficult to work with directly, we will use its Latin transcription.

Given a Latin transcription of the alphabet (a sequence of letter combinations, where each combination represents a single letter of the original alphabet) and a list of words written in this transcription, we need to sort the list alphabetically.

We consider all words to be written correctly. It's also important to note that when matching letter combinations, we should pick the longest possible combination greedily (the longest combination is always preferred).

For example:

If the alphabet is {"b", "bc", "aa", "c"} and the list of words is {"aab", "baa", "bcb", "bbc"}, then the sorted list will be {"bbc", "baa", "bcb", "aab"}.