Glassdoor users rated their interview experience at Pocket Gems as 100% positive with a difficulty rating score of 5 out of 5 (where 5 is the highest level of difficulty). Candidates interviewing for Mobile Engineer and rated their interviews as the hardest, whereas interviews for Mobile Engineer and roles were rated as the easiest.
The hiring process at Pocket Gems takes an average of 42 days when considering 1 user submitted interviews across all job titles. Candidates applying for Mobile Engineer had the quickest hiring process (on average 42 days), whereas Mobile Engineer roles had the slowest hiring process (on average 42 days).
The process took 1 day. I interviewed at Pocket Gems in May 2012
Interview
It was a one hour interview. With three questions. The interviewer seemed very disinterested. Neways they asked me 3 questions. First one was reverse a string. I did in place reverse using single for loop. 2nd one was a trick but popular question. 10 jars with 100marbles each. On jar has marbles weighing 1.1g others 1g. Find out which jar it is and in minimum number of comparisons. I knew the answer was one but forgot the methodology. Next one was find the least common ancestor of a binary tree(bot binary search tree).
2nd one was a trick but popular question. 10 jars with 100marbles each. On jar has marbles weighing 1.1g others 1g. Find out which jar it is and in minimum number of comparisons.
I applied through an employee referral. The process took 1 day. I interviewed at Pocket Gems in Jan 2012
Interview
I had an initial informal interview with the campus recruiter who got me a technical phone interview. The technical interview was on the phone, was 45 minutes long, and consisted of two programming questions that were relatively easy. The recruiter was pretty friendly, and the interviewer was pretty cordial. I felt confident about the interview, but I was told I wasn't a good fit.
Interview questions [5]
Question 1
given an array of n unsorted integers and each number is at most k positions away from its final sorted position, give an efficient sorting algorithm.