Pocket Gems Programmer Interview Questions | Glassdoor

Find jobs for Programmer

Pocket Gems Programmer Interview Questions

Interviews at Pocket Gems

3 Interview Reviews

Experience

Experience
33%
67%
0%

Getting an Interview

Getting an Interview
100%

Difficulty

4.0
Average

Difficulty

Hard
Average
Easy

Helpful (1)  

Programmer Interview

Anonymous Interview Candidate in San Francisco, CA
No Offer
Neutral Experience
Average Interview

Application

The process took 2 days. I interviewed at Pocket Gems (San Francisco, CA) in January 2012.

Interview

I interviewed in their San Francisco office. I talked to 4 different people.

Interview Questions

  • Implement the following functions for a binary tree:

    Insert
    PrintInOrder
    PrintPreOrder
    PrintPostOrder

    Implement a non-recursive PrintInOrder   Answer Question
  • You are given an array with integers between 1 and 1,000,000. One integer is in the array twice. How can you determine which one? Can you think of a way to do it using little extra memory.   Answer Question
  • Implement a Queue class in C++. Which data structure to use internally? Why? How to notify of errors?   Answer Question
  • Count the number of set bits in a 32 bit integer.   Answer Question
  • There are n gas stations positioned along a circular road. Each has a limited supply of gas. You can only drive clockwise around the road. You start with zero gas. Knowing how much gas you need to get from each gas station to the next and how much gas you can get at each station, design an algorithm to find the gas station you need to start at to get all the way around the circle.   Answer Question

Other Interview Reviews for Pocket Gems

  1. Helpful (5)  

    Programmer Interview

    Anonymous Employee in San Francisco, CA
    Accepted Offer
    Positive Experience
    Difficult Interview

    Application

    I applied in-person. The process took 2 weeks. I interviewed at Pocket Gems (San Francisco, CA) in February 2012.

    Interview

    I applied through the website.

    I spoke on the phone several times with hiring managers. I had three phone screens with engineers. We used Google Docs to write a lot of code. It was very low-level stuff like arrays and strings.

    When I came on site I spoke with 7 different people, mostly technical engineers. The interviews were very difficult, very detailed questions

    Interview Questions

    • Implement a method to perform basic string compression using the counts of repeated characters. "aabcccc" becomes "2a1b4c".   3 Answers
    • Given an image represented by an NxN array, rotate it by 90 degrees. Do it in place.   2 Answers
    • Write a program that takes a 2D array and if an element is 0, it's entire row and column are set to 0. Do it in place.   1 Answer

  2. Helpful (1)  

    Programmer Interview

    Anonymous Interview Candidate in San Francisco, CA
    No Offer
    Neutral Experience
    Difficult Interview

    Application

    The process took 1 day. I interviewed at Pocket Gems (San Francisco, CA) in November 2011.

    Interview

    I came onsite to talk with them. THey really liked my database backed work. The people here were all really smart and talented. I would have really liked to work here. They have free drinks at the office and a pool table and some other game machines. They seem pretty laid back. Everybody wears casual clothes.

    Interview Questions

    • Write code to partition a linked list around a value x so that all nodes less than x come before all nodes greater than x.   1 Answer
    • You have two numbers represented by a linked list where each node contains a single digit. The digits are stored in reverse order. Write a function to add two numbers and return another linked list.   Answer Question
    • Given a circular linked list, write a function to return the node at the beginning of the circle.   Answer Question
    • Implement a function to check if a singly-linked list is a palindrome.   Answer Question
Don't Miss Out On a Job You Love
Upload a resume to easily apply to jobs from anywhere. It's simple to set up.