Aller au contenuAller au pied de page
  • Emplois
  • Entreprises
  • Salaires
  • Pour les employeurs

      Boostez votre carrière

      Découvrez votre salaire potentiel, décrochez des emplois de rêve et partagez vos témoignages de manière anonyme.

      employer cover photo
      employer logo
      employer logo

      Pocket Gems

      Est-ce votre entreprise ?

      À propos
      Avis
      Salaires et avantages
      Emplois
      Entretiens
      Entretiens
      Recherches associées: Avis sur Pocket Gems | Offres d’emploi chez Pocket Gems | Salaires chez Pocket Gems | Avantages sociaux chez Pocket Gems
      Entretiens chez Pocket GemsEntretiens d’embauche pour Mobile Developer chez Pocket GemsEntretien chez Pocket Gems


      Glassdoor

      • À propos
      • Récompenses
      • Blog
      • Nous contacter
      • Guides

      Employeurs

      • Compte employeur gratuit
      • Centre employeur
      • Blog pour les employeurs

      Informations

      • Aide
      • Règles de la communauté
      • Conditions d'utilisation
      • Confidentialité et choix publicitaires
      • Ne pas vendre ni partager mes informations
      • Outil de consentement aux cookies

      Travailler avec nous

      • Annonceurs
      • Carrières
      Télécharger l'application

      • Parcourir par :
      • Entreprises
      • Emplois
      • Lieux

      Copyright © 2008-2026. Glassdoor LLC. « Glassdoor », son logo, « Worklife Pro » et « Bowls » sont des marques déposées de Glassdoor LLC.

      Entreprises suivies

      Tenez-vous au courant des dernières opportunités et profitez de conseils d’initiés en suivant les entreprises de vos rêves.

      Recherche d’emplois

      Obtenez des recommandations et des mises à jour personnalisées en démarrant vos recherches.

      Entretien pour Mobile Developer

      21 févr. 2012
      Employé (anonyme)
      San Francisco, CA

      Autres retours d’entretien d’embauche pour un poste comme Mobile Developer chez Pocket Gems

      Entretien pour Mobile Developer

      10 mars 2016
      Candidat à l'entretien anonyme
      Los Angeles, CA
      Aucune offre
      Offre acceptée
      Expérience positive
      Entretien difficile

      Candidature

      Le processus a pris 1 jour. J'ai passé un entretien chez Pocket Gems (San Francisco, CA) en févr. 2012

      Entretien

      The first phone call was with a recruiter. They liked some work I'd done on an open source project that they use internally. The second phone call was They flew me out to San Francisco. I got to stay for three days. Only one day was spent interviewing. The other two days I visited friends and saw the sights of San Francisco. There were four interviews, but I spent the lunch break talking with some one, I think it was mostly about fit, so I count that as the fifth interview. Overall it was pretty nice experience. The questions were mostly very interesting questions. With some of them it's hard to even know where to start. Even if I didn't get the job, I enjoyed seeing San Francisco. The interviews themselves were very difficult. I really thought that I hadn't done well. I made a lot of coding mistakes, but I got an email two weeks later saying they were interested in hiring me. Yay!

      Questions d'entretien [5]

      Question 1

      How would you check if a binary tree is balanced? Write a program to implement your algorithm.
      1 réponse

      Question 2

      You are in a game of Russian Roulette with a revolver that has 3 bullets placed in three consecutive chambers. The cylinder of the gun will be spun once at the beginning of the game. Then, the gun will be passed between two players until it fires. Would you prefer to go first or second?
      2 réponse(s)

      Question 3

      At a movie theater, the manager announces that they will give a free ticket to the first person in line whose birthday is the same as someone who has already bought a ticket. You have the option of getting in line at any time. Assuming that you don't know anyone else's birthday, that birthdays are distributed randomly throughout the year, etc., what position in line gives you the greatest chance of being the first duplicate birthday?
      2 réponse(s)

      Question 4

      You are given a list of about half a million English words. All of the English words have fewer than 35 characters. You are also given a (potentially very long) input string of characters. Determine an algorithm that will find all of the valid anagrams of the input string. What data structures will you use? Is it efficient? Now that you've figured out the algorithm, implement it in the language of your choice. How would you parallelize it?
      1 réponse

      Question 5

      Given an array of 0's and 1's, and a number k, find the minimum window that contains k 0's. Write code.
      1 réponse
      2
      Expérience neutre
      Entretien moyen

      Candidature

      J'ai postulé en ligne. Le processus a pris 1 semaine. J'ai passé un entretien chez Pocket Gems (Los Angeles, CA) en mars 2016

      Entretien

      The whole interview was ok but I did sucks. Based on phone, you can choose what ever language you like. It interviewer went directly to the programming part. 2 small coding task asked. Anyway, it's relatively easy to get a interview. But I guess it's not very easy to continue.

      Questions d'entretien [1]

      Question 1

      Find the in order sequence node in a BST.
      Répondre à cette question

      Entretien pour Mobile Developer

      22 janv. 2013
      Candidat à l'entretien anonyme
      Aucune offre

      Candidature

      J'ai passé un entretien chez Pocket Gems

      Entretien

      Via recruiter, LinkedIn, Facebook. First by LinkedIn email then evitedoc. Then phone interview with HR, followed by phone interview with Tech. Phone interview lasts about 40 minutes. After that will be on-site interview at San Francisco. Offer discussion after...

      Questions d'entretien [1]

      Question 1

      More algorithm/data structure question than actual game dev, graphic related questions!
      Répondre à cette question