The interview had 2 components: a phone screen loop and an onsite loop. For the onsite, my recruiter kept changing what interviews I had, and in the end, they scheduled a different interview from what they told me. On top of that, one of my interviewers asked me to design a database for my programming interview and gave me no instructions, no context, and no test cases. This was perhaps the worst interview I have ever done, and it felt like he was intentionally gatekeeping candidates from joining the company.
This whole process dragged on for about a month, much longer than I anticipated. It kicked off with a technical phone screen, where I was asked about data structures and algorithms. The DSA questions were tough, especially one regarding matrix traversal. Mid-way through the coding round, it clicked that I had tackled this exact problem on PracHub just days before, which helped me structure my answer. The onsite included system design questions that were challenging, but I didn’t end up receiving an offer. Overall, it was an intense experience.
Preguntas de entrevista [1]
Pregunta 1
Given an n x n matrix where each row and each column is sorted in ascending order, return the kth smallest element in the matrix. Walk through both the min-heap approach and the binary-search-on-value approach, compare their time and space complexity, and discuss which one you'd prefer for very large matrices that don't fit in memory.
2 rounds phone screen(1 coding + 1 system design) and 4 rounds onsite interviews(1 coding + 1 design + 1 deep dive + 1 behavior).
general good experience but need fast coding
Me postulé a través de otra fuente. Acudí a una entrevista en OpenAI (Dublín, Dublín) en may 2026
Entrevista
Two hiring manager interviews. Followed by a technical interview on coding and system design. Asked to design a devbox system (CI/CD pipeline). For the coding roundm I was asked to design the LRU/LFU cache.
Preguntas de entrevista [1]
Pregunta 1
I was asked to design the LRU/LFU cache.
design a devbox system (CI/CD pipeline).
