Candidatei-me por meio de recrutador(a). O processo levou 4 semanas. Fui entrevistado pela Digital Extremes em ago. de 2022
Entrevista
No nonsense, straightforward interview. Which was definitely appreciated. It was all done in a single interview + aptitude test. I was asked questions about the aptitude test, why I did things the way I did, ways that it could have been done better, and what different algorithms may have contributed to the problem. Then I was asked questions about a similar problem where I talked through my ideas and solutions.
Perguntas de entrevista [1]
Pergunta 1
On the prior aptitude test I completed. Why did I choose the algorithm that I did? And explain my thoughts? The some math questions about how I might program an explosion. All the way from the naive answer of a simple distance check. To how would you detect when an explosive projectile makes impact with a complex surface. How would you make sure it didn't lag through. How would you detect whether a entity was or was not behind cover from the explosion.
Candidatei-me online. O processo levou 4 semanas. Fui entrevistado pela Digital Extremes em ago. de 2023
Entrevista
It was a programming test for a small Visual Studio project. The test could be completed in a couple of afternoons, but time limit was a week.
What it bothers me is that they turned it down with no feedback. I literally don't know what I did so wrong to not continue the process.
Perguntas de entrevista [3]
Pergunta 1
Find as many bugs with the existing code as you can. There are several subtle
but common errors throughout the code. It compiles, and runs, but would not
stand up to production use.
For bonus marks, add a few statements here-and-there to make the code more
quick to detect errors.
You can impose any reasonable restrictions on how the functions can be used
and abused. Halting the program on error illegal input is acceptable in most
cases, but use your judgement for deciding when it isn't appropriate.
Implement the "findPowerUp" function sketched out in Main.cpp. It is to find a
path through the graph of PathNodes to the nearest PowerUp of the given mType.
Return NULL for no-path, or return an allocated array containing the path as
shown in the function skeleton. We are looking for the shortest path to a
matching powerup -- ie. the path where the sum of the edge weights is
minimized, where an edge weight is the distance between connected vertexes.
Please briefly describe the algorithm you chose and why you chose it in a
comment block at the top of the function. You will be evaluated on correctness,
efficiency from a performance and memory perspective, as well as general code
structure and understandability.
Please assume that your code may be called from a multi-threaded environment
(more than 1 search query at the same time).
Fill in the Armor and Weapon classes. Add members and methods that you think
would be useful for these kinds of objects. What you add is totally up to you;
it's more meant to show your personal coding style and how you think about
what kind of functionality you'd want to add to the game.
This part is very subjective, so don't worry about it -- there is no wrong
answer.
Candidatei-me por meio de uma agência de recrutamento. O processo levou 2 semanas. Fiz uma entrevista na empresa Digital Extremes.
Entrevista
The interview process was very straight forward and refreshingly short. It included a quick chat with a recruiter, a take-home test, and finally an interview with leads. At every step, the outcome was communicated with me instantly and honestly.
Perguntas de entrevista [1]
Pergunta 1
The final interview was more of a enjoyable conversation than anything else. I was asked to think about some common gameplay programming concepts and situations. As you might expect in a discussion at work, we arrived at solutions organically.