I applied online. The process took 1 day. I interviewed at Qualtrics
Interview
It was rigorous and thorough. The interviewer did a good job in pushing me to think critically about the coding problems presented and in encouraging me to reflect on my past experiences and why I would be a good fit for the company.
Interview questions [1]
Question 1
Could you please elaborate more on this specific project from your past internship?
I applied online. The process took 2 weeks. I interviewed at Qualtrics (Kraków) in Mar 2025
Interview
90 mins OA, 90 mins of first coding interview with 2 medium LC, 60 minutes second interview (15m personal qualities + LC medium).
In my case, the OA was very easy, I've been doing LC mediums for a while, so I was able to ace it. Interviews and their approach however, were out of proportion for a junior position and did not reflect at all the problems in the OA...
The first problem in the first interview was so confusing, that with the stress I was not able to understand it in the first 15m, with the interviewer saying "so, wanna start coding or what?". The second problem, I began trying to use a heap, but because of the stress I completely missed that I could try a stack.
The second interview, started with a chat about the interviewer drilling down on some aspects of previous experiences, so, make sure you can talk about your stories. Then I got a problem that I understood and knew how to approach it (bucket sort, not the best, but it would work). The interviewer went on to constantly interrupt me on giving me hints to drop my current approach and do something else that I did not know at the time how to do. Which is odd, because at the start they say "the most important thing is for the code to run and pass all tests", but they won't let you finish the solution YOU KNOW, that passes all the tests. After the interviewer I checked for the solution and bucket would work.
TLDR: If you like "Dance monkey, dance!" interviews Qualtrics is for you!
Interview questions [1]
Question 1
OA:
- Top K frequent elements (elements sorted inside each frequency),
-Prefix and Suffix sum,
- Break the prison (Naukri code 360)
Interview 1:
- Rotate array by k, where k is a value in another array. And you need to return an array where each index contains the index of the maximum element.
- Similar to Asteroid Collision, but for stones. Where the direction is index dependent. So [1, -1], both stones collide, [-1, 1] stones never collide.
Interview 2:
- Tell me about a time you made a SIGNIFICANT mistake. (With follow ups)
- Least number of unique Integers after K removals
2 entrevistas técnicas y una de personalidad.
Experiencia muy enriquecedora, presencial y con managers globales.
Es importante mencionar que no solo se trata de hacer escribir código si no de comprenderlo y optimizarlo.