Ir al contenidoIr al pie de página
  • Empleos
  • Empresas
  • Sueldos
  • Para empleadores

      Impulsa tu carrera profesional

      Averigua cuánto podrías ganar, encuentra el empleo perfecto y comparte información sobre tu vida laboral y personal de forma anónima.

      employer cover photo
      employer logo
      employer logo

      Google

      Empleador activo

      Información
      Evaluaciones
      Pago y prestaciones
      Empleos
      Entrevistas
      Entrevistas
      Búsquedas relacionadas: Evaluaciones de Google | Empleos en Google | Sueldos en Google | Prestaciones en Google
      Entrevistas en GoogleEntrevistas para el cargo de Software Engineer en GoogleEntrevista en Google


      Glassdoor

      • Acerca de
      • Premios
      • Blog
      • Contacto

      Empleadores

      • Cuenta de empleador gratuita
      • Centro de empleador

      Información

      • Ayuda
      • Pautas
      • Condiciones de uso
      • Privacidad y opciones de anuncios
      • No vender ni compartir mi información
      • Herramienta de autorización de cookies

      Trabaja con nosotros

      • Anunciantes
      • Oportunidades laborales
      Descargar aplicación

      • Buscar por:
      • Empresas
      • Empleos
      • Ubicaciones

      Copyright © 2008-2026. Glassdoor LLC. "Glassdoor", "Worklife Pro", "Bowls" y sus logotipos son marcas comerciales registradas de Glassdoor LLC.

      Empresas seguidas

      Sigue a tus empresas favoritas para estar al tanto de las últimas oportunidades y disponer de información desde adentro.

      Búsquedas de empleo

      Recibe recomendaciones y actualizaciones personalizadas al iniciar tu búsqueda.

      Entrevista para Software Engineer

      28 feb 2013
      Candidato de entrevista anónimo
      Los Angeles, CA
      Sin ofertas
      Experiencia neutra
      Entrevista difícil

      Solicitud

      Me postulé a través de un reclutador. Acudí a una entrevista en Google (Los Angeles, CA)

      Entrevista

      I contacted a recruiter, and asked about applying.

      Preguntas de entrevista [5]

      Pregunta 1

      The first phone interview was just a series of high level questions. Here are a couple: 1) Why are calls to virtual functions slower 2) How would you find the maximum occurrence of a word in a huge file (no coding - just high level explanation). 3) What is the factory pattern. Things like that The second phone interview was purely coding 1 big long, but easy problem. The problem was this: Write code to verify a Sudoku board.
      1 respuesta

      Pregunta 2

      First Person: Simply high level questions about how to achieve certain things. For example: 1) How would you write a pancake sort routine 2) You have a network of friends (linked in friends, facebook friends, etc). How would you keep track of all the people you are connected to. 3) What is the run time of the A* search (only because I mentioned it somewhere along the line). Second person: 1) Write code to find duplicates in a linked list 2) How would you synchronize a linked list across multiple computers. If nodes are added/removed to a linked list on one computer, all others must reflect this change. Concurrancy must be accounted for
      1 respuesta

      Pregunta 3

      Third person: Given a 2-d array, write code to print it out in a snake pattern. For example, if the array is this: 1, 2, 3 4, 5, 6 7, 8, 9 the routine prints this: 1,2,3,6,9,8,7,4,5 The array is an NxN array. The final question was just how to write a connection pool (i.e, a class that returns connections to the user, and if the user is done, returns them back to the pool)
      4 respuestas

      Pregunta 4

      Given a set top box: a, b, c, d, e, f, g, h, i, j, k, l, m, n, o p, q, r, s, t u, v, w, x, y z Write code to give the character sequence given a word, For example, if the word is "CON", the function will print this: Right//now we're at B Right//now we're at C OK//to select C Down DOwn Right Right OK//to select O Left//now at N OK//to select N note: Be careful when you're at Z. if you go to the right, you will get stuck. Afterwards, the interviewer adds a space to the right of 'Z' to test the code.
      2 respuestas

      Pregunta 5

      Write a routine that does secret santa in O(N) time.
      4 respuestas
      22

      Otras evaluaciones sobre las entrevistas para el cargo de Software Engineer en Google

      Entrevista para Software Engineer

      4 may 2014
      Empleado anónimo
      Auburndale, FL
      Oferta aceptada
      Experiencia positiva
      Entrevista difícil

      Solicitud

      Me postulé a través de una recomendación de un empleado. Acudí a una entrevista en Google (Auburndale, FL) en abr 2014

      Entrevista

      Direct onsite because I interviewed in the past and did well that time. From the time I sent my resume to interview day: 2 weeks. From interview day to offer over the phone: 2 weeks. The syllabus for the interviews is very clear and simple: 1) Dynamic Programming 2) Super recursion (permutation, combination,...2^n, m^n, n!...etc. type of program. (NP hard, NP programs) 3) Probability related programs 4) Graphs: BFS/DFS are usually enough 5) All basic data structures from Arrays/Lists to circular queues, BSTs, Hash tables, B-Trees, and Red-Black trees, and all basic algorithms like sorting, binary search, median,... 6) Problem solving ability at a level similar to TopCoder Division 1, 250 points. If you can consistently solve these, then you are almost sure to get in with 2-weeks brush up. 7) Review all old interview questions in Glassdoor to get a feel. If you can solve 95% of them at home (including coding them up quickly and testing them out in a debugger + editor setup), you are in good shape. 8) Practice coding--write often and write a lot. If you can think of a solution, you should be able to code it easily...without much thought. 9) Very good to have for design interview: distributed systems knowledge and practical experience. 10) Good understanding of basic discrete math, computer architecture, basic math. 11) Coursera courses and assignments give a lot of what you need to know. 12) Note that all the above except the first 2 are useful in "real life" programming too! Interview 1: Graph related question and super recursion Interview 2: Design discussion involving a distributed system with writes/reads going on at different sites in parallel. Interview 3: Array and Tree related questions Interview 4: Designing a simple class to do something. Not hard, but not easy either. You need to know basic data structures very well to consider different designs and trade-offs. Interview 5: Dynamic programming, Computer architecture and low level perf. enhancement question which requires knowledge of Trees, binary search, etc. At the end, I wasn't tired and rather enjoyed the discussions. I think the key was long term preparation and time spent doing topcoder for several years (on and off as I enjoy solving the problems). Conclusion: "It's not the best who win the race; it's the best prepared who win it."
      2501

      Entrevista para Software Engineer

      3 jun 2026
      Candidato de entrevista anónimo
      Sin ofertas
      Experiencia negativa
      Entrevista difícil

      Solicitud

      Acudí a una entrevista en Google

      Entrevista

      Etapa de RH para filtragem de curriculo e fit inicial, e Screening Técnico com código em leetcode focado em algoritmos, onde o código era feito em um bloco de notas, sem uso de IDEs.

      Preguntas de entrevista [1]

      Pregunta 1

      Você conhece sobre Big O notation?
      Responder pregunta

      Entrevista para Software Engineer

      3 jun 2026
      Candidato de entrevista anónimo
      Mountain View, CA
      Sin ofertas
      Experiencia positiva
      Entrevista fácil

      Solicitud

      Acudí a una entrevista en Google (Mountain View, CA)

      Entrevista

      Round 1 consists of coding and behavioural interviews. In behavioural, it was basic questions; it can be found online, so make sure you have all the stories ready. For DSA, it was a pretty much easy question related to Intervals or Heaps, don't want to reveal the questions directly!!

      Preguntas de entrevista [1]

      Pregunta 1

      DSA question based on Intervals, Heaps
      Responder pregunta

      Las mejores empresas en cuanto a "Remuneración y prestaciones" cerca de ti

      avatar
      Amazon
      3.7★Remuneración y prestaciones
      avatar
      Maze
      4.5★Remuneración y prestaciones