Ingeniero Interview Questions

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,137,018 ingeniero interview questions shared by candidates

1.Given a string, write a function that return if it is Palindrome. This wasn't asked directly but from interviewer example i was need to understand that this function must ignore all spaces and special symbols. 2. Given an array, write a function that return true if any 3 elements of this array can sum to 0. My first solution was the simplest and far from best which result in O(n^3). Then interviewer asked me to improve to improve it to O(n^2). This give me a hint that i can use Hash to reduce complexity.
avatar

Android Developer

Interviewed at Meta

3.5
Jan 19, 2015

1.Given a string, write a function that return if it is Palindrome. This wasn't asked directly but from interviewer example i was need to understand that this function must ignore all spaces and special symbols. 2. Given an array, write a function that return true if any 3 elements of this array can sum to 0. My first solution was the simplest and far from best which result in O(n^3). Then interviewer asked me to improve to improve it to O(n^2). This give me a hint that i can use Hash to reduce complexity.

Given an array of numbers, nums, return an array of numbers products, where products[i] is the product of all nums[j], j != i. Input : [1, 2, 3, 4, 5] Output: [(2*3*4*5), (1*3*4*5), (1*2*4*5), (1*2*3*5), (1*2*3*4)] = [120, 60, 40, 30, 24] You must do this in O(N) without using division.
avatar

Software Development Engineer

Interviewed at Amazon

3.5
Sep 25, 2012

Given an array of numbers, nums, return an array of numbers products, where products[i] is the product of all nums[j], j != i. Input : [1, 2, 3, 4, 5] Output: [(2*3*4*5), (1*3*4*5), (1*2*4*5), (1*2*3*5), (1*2*3*4)] = [120, 60, 40, 30, 24] You must do this in O(N) without using division.

I got a few C++ questions, then a question on sorting algorithms then a brainteaser. The brainteaser went as follows: Three people are given hats. Each hat is either red or blue, chosen at random. Each person can see the other 2 hats, but not their own. They each must simultaneously either guess their own hat's color, or pass. No communication is allowed, although they can agree on a strategy ahead of time. What strategy will give them the best chances of at least one person guessing right, and nobody guessing wrong?
avatar

High Frequency Developer

Interviewed at Tower Research Capital

4.1
Nov 29, 2011

I got a few C++ questions, then a question on sorting algorithms then a brainteaser. The brainteaser went as follows: Three people are given hats. Each hat is either red or blue, chosen at random. Each person can see the other 2 hats, but not their own. They each must simultaneously either guess their own hat's color, or pass. No communication is allowed, although they can agree on a strategy ahead of time. What strategy will give them the best chances of at least one person guessing right, and nobody guessing wrong?

Find the first index of the substring. Condition: Do not use java library function or regular expressions. And measure the performance of your implementation with the standard java library function. Examples: String 1: “abcdefg” String 2: “bcd” Should return 1 String 1: “abcdefg” String 2: “x” Should return -1
avatar

Software Engineer

Interviewed at Salesforce

4
May 2, 2012

Find the first index of the substring. Condition: Do not use java library function or regular expressions. And measure the performance of your implementation with the standard java library function. Examples: String 1: “abcdefg” String 2: “bcd” Should return 1 String 1: “abcdefg” String 2: “x” Should return -1

In a party of N people, only one person is known to everyone. Such a person may be present in the party, if yes, (s)he doesn’t know anyone in the party. We can only ask questions like “does A know B? “. Find the stranger (celebrity) in minimum number of questions.
avatar

Software Development Engineer

Interviewed at Amazon

3.5
Aug 3, 2016

In a party of N people, only one person is known to everyone. Such a person may be present in the party, if yes, (s)he doesn’t know anyone in the party. We can only ask questions like “does A know B? “. Find the stranger (celebrity) in minimum number of questions.

Viewing 111 - 120 interview questions

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