J'ai postulé via un établissement d'enseignement supérieur ou universitaire. Le processus a pris 3 semaines. J'ai passé un entretien chez Pocket Gems en déc. 2013
Entretien
Dropped off resume at career fair, got an email from HR with a big "Congratulations!" which asks me for availability for technical interviews. I get a phone call from a backend engineer. Very technical (isn't interested in talking about resume/experience) goes straight to questions after some of my questions. Oh, they also provided a stypi link for both of the interviews.
LCA of tree & Reverse a string. Cool.
I land the second interview. This guy is also not very interested about talking about stuff, he'd rather just go to the technical questions. My memory is vague but it was substrings and deep copying a graph.
I ran out of time and wasn't able to think quickly enough. Haven't gotten a rejection yet, it's been more than a week.
Questions d'entretien [1]
Question 1
1. LCA of tree & reverse string
2. Substring & Deep copy graph
J'ai postulé en ligne. Le processus a pris 3 semaines. J'ai passé un entretien chez Pocket Gems (Iowa City, IA) en nov. 2021
Entretien
First I got sent two Hackerrank Assesment questions. followed by a technical interview with a Pocket gems software engineer and a final round technical interview.
I failed the first technical part but had a good experience
Questions d'entretien [1]
Question 1
Technical interview was a depth first search graph problem, not too hard. Don't remember exact questions
Thank you for sharing your experience with us. We are happy to hear you had a positive experience with us even if it did not work out in the end. Wishing you all the best!
I got a phone interview with one of the developers after submitting my resume through their website. He had me code on Stypi. Overall, it was a pretty straightforward pleasant experience.
Questions d'entretien [1]
Question 1
The first couple of questions were not difficult (i.e. reverse a string). The last one caught me off guard because it was one of those questions that was very difficult to reason through if you hadn't seen it before. If you plan on applying here, make sure to do some practice questions and look through your string manipulation and trees.