The first interview was with HR, who asked somewhat unusual questions regarding the improvement of their service or website. It was interesting. When you give your thoughts and suggestions, a follow-up discussion will follow. After that, a question about a recent technological challenge was asked. If they are satisfied with your answers, you will be explained what the next steps are and how the technical interview will look. The HR representative stated that the problems in the second interview would be much harder than the ones from their hackathon.

The second round of interview is technical. In this instance, there were two interviewers. I had two problems to solve. More about this is in the Questions section. They ask for algorithms, not a working app.

Union of n arrays with x elements. Output common members contained in at least 2 arrays. Explain the complexity of the algorithm used.

We have a digested server log with username, visited page, and timestamp. Create a processing algorithm that will output the most visited page/areas, matching partial paths as well.

i.e. { { user: "user1", page:"/home" }, { user: "user1", page:"/home/account" }, { user: "user1", page:"/home/account/profile" }, { user: "user1", page:"/home/account/login" }, { user: "user2", page:"/about" }, { user: "user2", page:"/about/contact" }, { user: "user2", page:"/home" } }

Output: user1 - home/account - home user2 - /about

PS: I'm rephrasing because I cannot recall the exact question.