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

      Amazon

      Empleador activo

      Información
      Evaluaciones
      Pago y prestaciones
      Empleos
      Entrevistas
      Entrevistas
      Búsquedas relacionadas: Evaluaciones de Amazon | Empleos en Amazon | Sueldos en Amazon | Prestaciones en Amazon
      Entrevistas en AmazonEntrevistas para el cargo de Software Developer Engineer en AmazonEntrevista en Amazon


      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. Indeed, Inc. "Glassdoor", "Worklife Pro", "Bowls" y sus logotipos son marcas comerciales registradas de Indeed, Inc.

      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 Developer Engineer

      15 de oct de 2016
      Empleado anónimo
      Luxemburgo
      Oferta aceptada
      Experiencia positiva
      Entrevista promedio

      Solicitud

      Me postulé en línea. El proceso tomó 4 semanas. Acudí a una entrevista en Amazon (Luxemburgo) en mar 2016

      Entrevista

      First they send you an e-mail with numerical reasoning test, and you have cca 10 days to finish it. This is basically processing data from the tables, calculating some kind of average from the columns and stuff like that. It is not that hard, but limited time can be a problem. Calculator is allowed. Second phase is speaking to the HR over the telephone and telling some basic stuff about yourself, like what is that you are currently doing, on what particular role are you interested, in what technologies you have experience and what would you like to do, when you are available and for how long, etc. Third phase is technical telephone interview. It is 1 on 1 with an interviewer, they send you a link to some kind of online text editor where you write code, and the interviewer sees it in live time. Generally they test your problem solving ability. You are given some basic problem, like remove all duplicates from the array, and then there are follow up questions to this problems, like how can you improve this algorithm if you knew that the value of element in the array is always between 0 and array size. I also got a question to code a function that tests whether a binary tree is a binary search tree. Fourth and final phase is the onsite interview. You have all the expenses covered, and hotel and plain is also booked for you for the time frame in accordance to what you previously stated with your recruiter. If you provide the bills, taxi and food are also reimbursed. The onsite interview I had consisted of 3 rounds, each round with one recruiter who interviews you for one specific problem. Basically the same procedure as the phone interview, but this time you are coding it on the whiteboard. So yeah, it is basically the problem solving ability. It can be trained by practicing by the Cracking the coding interview book, and whatever algorithmic problems you find online.

      Preguntas de entrevista [1]

      Pregunta 1

      Questions I had was BFS/DFS implementation for a certain graph problem, then again some kind of removing duplicates from the array (but this time with some extra constraint - cant really remember) and third round was some kind of phonebook search algorithm where you only discuss and don't actually code anything, but you draw on a white-board and talk about the problem. The solution to the problem turned out to be a prefix tree, which I have never implemented (and knew not much about it) but during the problem solving process I managed to come up with the this structure.
      Responder pregunta
      4