Pergunta da entrevista

Entrevista para Senior Software Engineer

-São Paulo, São Paulo, São Paulo


Build a regular expression parser in Java that matches expressions like 'aabbc' and say what is its order of growth in Big O notation.


Respostas da entrevista

2 respostas


I built a finite state machine with 'for' loops. The Big O notation was O(n) aka linear complexity.

Confidencial em


There's a lot of elements to typically cover in these questions, clarifications, scoping, making sure you're answering the actual question the interviewer is looking for you to answer, etc. Could be worth doing a mock interview with one of the Prepfully Xandr Senior Software Engineer experts... they've worked in the role so they clearly know how to get through the interview.

Confidencial em

Adicionar respostas ou comentários

Para comentar sobre isso, entre na conta ou cadastre-se.