Skip to contentSkip to footer

Ingeniero Interview Questions

Salaries
Interviews

Ingeniero Interview Questions

Un ingeniero es responsable de diseñar y crear productos. En el contexto de una entrevista, es posible que te pregunten acerca de tus habilidades técnicas y que te evalúen por tu capacidad de trabajar en equipo con el fin de conseguir crear o construir cosas. El tipo de preguntas que te harán dependerá del tipo de puesto de ingeniero que estés buscando, o lo que es lo mismo, la disciplina de ingeniería concreta como, por ejemplo, de software, eléctrica o mecánica.

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

Question 1

Pregunta n.º 1: ¿Cuál es el proyecto de ingeniería más difícil que has abordado, y cómo te aseguraste de poder terminarlo con éxito?

How to answer
Respuesta recomendada: Para esta pregunta deberás dar un ejemplo en concreto. Lo ideal sería que eligieses un proyecto que refleje el tipo de trabajo que harías en el puesto solicitado. Aunque no haya sido tu proyecto más exigente, asegúrate de describir los obstáculos y el resultado satisfactorio de forma clara y con entusiasmo.
Question 2

Pregunta n.º 2: En tu puesto actual, ¿qué medidas tomas para no cometer errores?

How to answer
Respuesta recomendada: Tanto si sigues un proceso formal como si no, enumera las medidas específicas que empleas (p. ej., herramientas digitales, consultar a colegas, etc.). Asegúrate de que tu respuesta demuestre un compromiso con el control de calidad, la eficiencia y la seguridad.
Question 3

Pregunta n.º 3: Describe una situación en la que tuvieses que lidiar con un cliente o una parte interesada difícil.

How to answer
Respuesta recomendada: Esta pregunta también requiere un ejemplo específico que demuestre tu paciencia y buen criterio. El empleador busca pruebas de que eres capaz de atenerte a tus decisiones con seguridad y tranquilidad. Pon un ejemplo con un desenlace positivo.

1,136,609 ingeniero interview questions shared by candidates

Given an input string S write a function which returns true if it satisfies S = nT. Basically you have to find if a given string can be represented from a substring by iterating it “n” times. n >= 2 An example would suffice – Function should return true if 1) S = “abab” 2) S = “abcdabcd” 3) S = “abcabcabc” 4) S = “zzxzzxzzx” Function should return false if 1) S = “abac” 2) S = “abcdabbd” 3) S = “abcabcefg” 4) S = “zzxzzyzzx” It would be easy to understand if you can give an algo instead of saying use kmp or suffix tree or… I came up with O(n*n) solution. Wondered how to do in O(n)
avatar

Software Engineer

Interviewed at Google

4.4★
Mar 19, 2014

Given an input string S write a function which returns true if it satisfies S = nT. Basically you have to find if a given string can be represented from a substring by iterating it “n” times. n >= 2 An example would suffice – Function should return true if 1) S = “abab” 2) S = “abcdabcd” 3) S = “abcabcabc” 4) S = “zzxzzxzzx” Function should return false if 1) S = “abac” 2) S = “abcdabbd” 3) S = “abcabcefg” 4) S = “zzxzzyzzx” It would be easy to understand if you can give an algo instead of saying use kmp or suffix tree or… I came up with O(n*n) solution. Wondered how to do in O(n)

In front of you are three light switches. Only one does anything, and it turns on the light downstairs. From here you can't see the light, and it makes no sound. You must determine which switch operates the light, BUT you can only go check it once. How do you figure out which switch is for the light?
avatar

Software Engineer

Interviewed at RTX

3.8★
Mar 12, 2010

In front of you are three light switches. Only one does anything, and it turns on the light downstairs. From here you can't see the light, and it makes no sound. You must determine which switch operates the light, BUT you can only go check it once. How do you figure out which switch is for the light?

want you to write me a simple spell checking engine. The query language is a very simple regular expression-like language, with one special character: . (the dot character), which means EXACTLY ONE character (it can be any character). So, for example, 'c.t' would match 'cat' as the dot matches any character. There may be any number of dot characters in the query (or none). Your spell checker will have to be optimized for speed, so you will have to write it in the required way. There would be a one-time setUp() function that does any pre-processing you require, and then there will be an isMatch() function that should run as fast as possible, utilizing that pre-processing. There are some examples below, feel free to ask for clarification. Word List: [cat, bat, rat, drat, dart, drab] Queries: cat -> true c.t -> true .at -> true ..t -> true d..t -> true dr.. -> true ... -> true .... -> true ..... -> false h.t -> false c. -> false */ // write a function // Struct setup(List<String> list_of_words) // Do whatever processing you want here // with reasonable efficiency. // Return whatever data structures you want. // This function will only run once // write a function // bool isMatch(Struct struct, String query) // Returns whether the query is a match in the // dictionary (True/False) // Should be optimized for speed
avatar

Data Engineer

Interviewed at Meta

3.5★
May 22, 2020

want you to write me a simple spell checking engine. The query language is a very simple regular expression-like language, with one special character: . (the dot character), which means EXACTLY ONE character (it can be any character). So, for example, 'c.t' would match 'cat' as the dot matches any character. There may be any number of dot characters in the query (or none). Your spell checker will have to be optimized for speed, so you will have to write it in the required way. There would be a one-time setUp() function that does any pre-processing you require, and then there will be an isMatch() function that should run as fast as possible, utilizing that pre-processing. There are some examples below, feel free to ask for clarification. Word List: [cat, bat, rat, drat, dart, drab] Queries: cat -> true c.t -> true .at -> true ..t -> true d..t -> true dr.. -> true ... -> true .... -> true ..... -> false h.t -> false c. -> false */ // write a function // Struct setup(List<String> list_of_words) // Do whatever processing you want here // with reasonable efficiency. // Return whatever data structures you want. // This function will only run once // write a function // bool isMatch(Struct struct, String query) // Returns whether the query is a match in the // dictionary (True/False) // Should be optimized for speed

Given an input array and another array that describes a new index for each element, mutate the input array so that each element ends up in their new index. Discuss the runtime of the algorithm and how you can be sure there won't be any infinite loops.
avatar

Front End Engineer

Interviewed at Meta

3.5★
Apr 8, 2013

Given an input array and another array that describes a new index for each element, mutate the input array so that each element ends up in their new index. Discuss the runtime of the algorithm and how you can be sure there won't be any infinite loops.

Given input: // could be potentially more than 3 keys in the object above items = [ {color: 'red', type: 'tv', age: 18}, {color: 'silver', type: 'phone', age: 20} ... ] excludes = [ {k: 'color', v: 'silver'}, {k: 'type', v: 'tv'}, .... ] function excludeItems(items, excludes) { excludes.forEach(pair => { items = items.filter(item => item[pair.k] === item[pair.v]); }); return items; } 1. Describe what this function is doing... 2. What is wrong with that function ? 3. How would you optimize it ?
avatar

Front End Engineer

Interviewed at Meta

3.5★
Nov 27, 2017

Given input: // could be potentially more than 3 keys in the object above items = [ {color: 'red', type: 'tv', age: 18}, {color: 'silver', type: 'phone', age: 20} ... ] excludes = [ {k: 'color', v: 'silver'}, {k: 'type', v: 'tv'}, .... ] function excludeItems(items, excludes) { excludes.forEach(pair => { items = items.filter(item => item[pair.k] === item[pair.v]); }); return items; } 1. Describe what this function is doing... 2. What is wrong with that function ? 3. How would you optimize it ?

Viewing 31 - 40 interview questions

Glassdoor has 1,136,609 interview questions and reports from Ingeniero interviews. Prepare for your interview. Get hired. Love your job.