Desarrollador Web Interview Questions

Desarrollador Web Interview Questions

Las entrevistas para el puesto de desarrollador web suelen centrarse en las preguntas técnicas. Puedes esperar que te hagan preguntas para evaluar tu conocimiento de los principales lenguajes de programación, como JavaScript y CSS, y de las funciones web generales, o para conocer tu experiencia de diseño en servicios web como REST y SOAP. Como desarrollador, es probable que te pidan ejemplos de sitios web o proyectos anteriores.

Preguntas de entrevista más frecuentes para desarrollador/a web y cómo responderlas

Question 1

Pregunta n.º 1: ¿Podrías describir los lenguajes de programación y servicios web más populares?

How to answer
Respuesta recomendada: Con casi total seguridad, te preguntarán sobre lenguajes de programación y servicios web. Asegúrate de estar al día de los últimos lenguajes y servicios, incluidas las innovaciones y actualizaciones más recientes.
Question 2

Pregunta n.º 2: ¿Cómo te describirían los jefes de proyecto y otros desarrolladores web?

How to answer
Respuesta recomendada: Los empleadores quieren asegurarse de que encajarás bien con el resto del equipo de desarrollo. Si te formulan esta pregunta, destaca tu capacidad de trabajo en equipo. Puedes comentar tus dotes de comunicación, tus habilidades de escucha y tu capacidad para resolver conflictos.
Question 3

Pregunta n.º 3: ¿Cómo sueles resolver los problemas de código?

How to answer
Respuesta recomendada: El empleador quiere asegurarse de que tienes la capacidad para resolver cualquier problema de programación, de manera que puedas ser un miembro productivo de la plantilla. Comenta tus habilidades de resolución de problemas, tanto en el ámbito de la programación como de las relaciones en el lugar de trabajo; así demostrarás tu capacidad para superar dificultades en el trabajo. Puedes exponer tus habilidades analíticas, hablar de colaboraciones pasadas y explicar tu experiencia resolviendo problemas en proyectos anteriores.

710,392 desarrollador web interview questions shared by candidates

The questions were not very difficult but you really need to have all the concepts crystal-clear and be ready to apply them successfully. One of the questions was "how to count the letters in this string:" "The quick brown fox jumps over the lazy dog";
avatar

Software Development Engineer

Interviewed at Google

4.4
Apr 25, 2013

The questions were not very difficult but you really need to have all the concepts crystal-clear and be ready to apply them successfully. One of the questions was "how to count the letters in this string:" "The quick brown fox jumps over the lazy dog";

If you had a list of appointments (each appointment has a begin time, an end time, and a boolean hasConflict), how would you efficiently go through them and set the hasConflict boolean for each. You cannot assume they are sorted in any way. Keep in mind that one appointment may be very long, etc.
avatar

Software Engineer

Interviewed at Google

4.4
Nov 3, 2010

If you had a list of appointments (each appointment has a begin time, an end time, and a boolean hasConflict), how would you efficiently go through them and set the hasConflict boolean for each. You cannot assume they are sorted in any way. Keep in mind that one appointment may be very long, etc.

Phone interview question: Given a string pattern of 0s, 1s, and ?s (wildcards), generate all 0-1 strings that match this pattern. e.g. 1?00?101 -> [10000101, 10001101, 11000101, 11001101]. You can generate the strings in any order that suits you.
avatar

Software Engineer

Interviewed at Google

4.4
Aug 1, 2013

Phone interview question: Given a string pattern of 0s, 1s, and ?s (wildcards), generate all 0-1 strings that match this pattern. e.g. 1?00?101 -> [10000101, 10001101, 11000101, 11001101]. You can generate the strings in any order that suits you.

- Given an array, remove the duplicates and return a unique array keeping the first occurrence of the duplicates and the order. [@2, @1, @3, @1, @2] --> [@2, @1, @3] - how would you implement call for canceling queued blocks with dispatch_after?
avatar

IOS Developer

Interviewed at Meta

3.6
Nov 4, 2013

- Given an array, remove the duplicates and return a unique array keeping the first occurrence of the duplicates and the order. [@2, @1, @3, @1, @2] --> [@2, @1, @3] - how would you implement call for canceling queued blocks with dispatch_after?

Given an array with length n-1 which contains integers of the range 1 to n. Each element is distinct and appears only once. One integer is missing. Find the missing integer in linear time using O(1) memory. Now two integers are missing, find them out in linear time using O(1) memory. How about three?
avatar

Software Development Engineer

Interviewed at Microsoft

4
Jul 10, 2009

Given an array with length n-1 which contains integers of the range 1 to n. Each element is distinct and appears only once. One integer is missing. Find the missing integer in linear time using O(1) memory. Now two integers are missing, find them out in linear time using O(1) memory. How about three?

Consider an X x Y array of 1's and 0s. The X axis represents "influences" meaning that X influences Y. So, for example, if $array[3,7] is 1 that means that 3 influences 7. An "influencer" is someone who influences every other person, but is not influenced by any other member. Given such an array, write a function to determine whether or not an "influencer" exists in the array.
avatar

Senior Software Engineer

Interviewed at LinkedIn

3.8
Aug 1, 2013

Consider an X x Y array of 1's and 0s. The X axis represents "influences" meaning that X influences Y. So, for example, if $array[3,7] is 1 that means that 3 influences 7. An "influencer" is someone who influences every other person, but is not influenced by any other member. Given such an array, write a function to determine whether or not an "influencer" exists in the array.

assume you are writing number in ascending order to an array of constant size. once you reach the end of the array, you start writing from the beginning, thus writing over the oldest entries. write an algorithm for finding a specific number in this array.
avatar

Software Engineer

Interviewed at Google

4.4
Mar 12, 2010

assume you are writing number in ascending order to an array of constant size. once you reach the end of the array, you start writing from the beginning, thus writing over the oldest entries. write an algorithm for finding a specific number in this array.

Viewing 111 - 120 interview questions

Glassdoor has 710,392 interview questions and reports from Desarrollador web interviews. Prepare for your interview. Get hired. Love your job.