Pocket Gems Mobile Engineer Interview Questions
& Process
Real candidates share what happened, how many rounds they had,
and how the experience turned out.
Based on 20 interview experiences · FREE TO READ
Candidate interview experiences
First-hand accounts from people who interviewed at Pocket Gems.
Pocket Gems
Mobile Engineer
Entry Difficult Negative experience No offer 3 rounds
Interview process
Recruiter call Phone screen Onsite
Interview formats
Technical Coding Behavioral
I met them first at a career fair, and they invited me to dinner with other candidates. The next day, I had on-campus interviews that were about 30-45 minutes long, with basic programming questions and some whiteboard coding. After that, I had a phone interview which was 20-30 minutes long, with more basic programming questions and coding in a shared Google Doc. Then, they flew me out to San Francisco for a seven-hour interview where I met with different members of the development team in a conference room. I could take breaks for the bathroom and water, but I wasn't offered food and wasn't told to bring any. Most of the interview involved writing code for algorithms on a whiteboard. The questions were quite specific, requiring prior knowledge rather than on-the-spot reasoning. The last interviewer, the lead programmer, seemed to dislike me and made critical comments about my code syntax.
Confirmed questions2 questions
- How would you describe sorting integers that are read one by one from an unending stream?
- Can you describe or write code for an algorithm on a whiteboard?
Pocket Gems
Mobile Engineer
Mid Difficult Neutral experience No offer 3 rounds
Interview process
Recruiter call Phone screen Onsite
Interview formats
Technical Coding
A recruiting director from Pocket Gems messaged me on LinkedIn because of my open source contributions to their iPhone games. Even though I'm in San Francisco, they scheduled a couple of phone interviews before the in-person ones at their office. All the interviews were technical.
Confirmed questions5 questions
- Can you output Pascal's Triangle, first iteratively and then recursively, and explain the differences?
- Write a C program that takes a program from the input terminal during compilation, and then outputs the result of that second program when run.
- Given two strings, s1 and s2, can you write a snippet to check if s2 is a rotation of s1 using only one call to the strstr routine?
Pocket Gems
Mobile Engineer
Entry Difficult Positive experience No offer 1 round
Interview process
Recruiter call Phone screen Technical screen
Interview formats
Coding Technical
After I applied online, a recruiter emailed me in a couple weeks. They wanted two dates/times for a phone interview and my CV and contact info. The interview was set up. The interviewer asked me two coding questions: first, to reverse a string, and second, to write a method to find the lowest common ancestor of two nodes in a binary tree. After I wrote the code, I had to explain it using sample data. The interviewer was pretty chill.
Confirmed questions2 questions
- Could you write a function to reverse a string?
- Given the Node class and the LCA method signature, implement the function to find the lowest common ancestor of two nodes.
Pocket Gems Mobile Engineer Interview Questions
Quoted word for word from Pocket Gems interview reports.
“Reverse a string”
Read reports →“Find the first index of a substring within a string”
Read reports →“Given the Node class and the LCA method signature, implement the function to find the lowest common ancestor of two nodes.”
Read reports →“Design the strstr function.”
Read reports →“Find a substring within a string and return the starting position as an integer. Also, state the Big O notation for your algorithm.”
Read report →“Can you find the lowest common ancestor of two nodes in a binary tree?”
Read report →“Given numbers from 1 to n with one missing and one number repeated, find the missing and repeated numbers. State the Big O notation.”
Read report →“Write a C program that takes a program from the input terminal during compilation, and then outputs the result of that second program when run.”
Read report →“Can you find the in-order sequence node in a Binary Search Tree?”
Read report →Formats, difficulty and experience
Across all 20 Pocket Gems interview reports.