Solicité el puesto a través de la recomendación de un empleado. Acudí a una entrevista en Box en may 2025
Solicitud
Solicité el puesto a través de la escuela superior o la universidad. El proceso duró 4 días. Acudí a una entrevista en Box
Entrevista
2 Interviews back-to-back. Initially wanted to have them on-site, but decided to do it over Skype due to scheduling problems. Very enjoyable experience, and the questions I was asked were very open-ended and the interviewers were very friendly. Not extremely difficult, but they aren't a walk in the park either. The questions can be found on this site.
I received an offer at the end of the week, so the turn-around time was very quick. I was able to extend my deadline quite a bit as I was still interviewing with other companies.
Preguntas de entrevista [2]
Pregunta 1
Question regarding cache inconsistencies, threads, show possible race conditions, how to avoid them, etc. They go quite in-depth in solving this problem, depending on what experience you've had so far. The fully detailed question is somewhere else on this site.
Very well described process, extremely good communication during the process. As an interns we had office hours on which the OA was described in details, we could ask questions about the OA but also about Box.
Preguntas de entrevista [1]
Pregunta 1
Very common behavioral questions, questions about the previous projects/experience.
Envié una solicitud electrónica. Acudí a una entrevista en Box (Varsovia, Mazovia) en may 2025
Entrevista
After sending cv received an online assessment that included 3 Leetcode medium problems. Around 1.5hrs to solve, more than enough, manageable if you know what are you doing. Got rejected afterwards.
Preguntas de entrevista [1]
Pregunta 1
Online assessment that included 3 Leetcode medium problems
2 hour long skype interviews.
Both were technical.
First was brain teasers and the second was about object oriented programming.
Here are the questions:
given a tree of nodes, how can you check whether or not the tree is 'unival' (all nodes have the same value) ?
given a tree of nodes how can you find out how many subtrees are 'unival' ?
both questions had recursive solutions
