Find the minimum depth of binary search tree
Engenheiro Interview Questions
Engenheiro Interview Questions
Os(as) engenheiros(as) são responsáveis por desenvolver e construir produtos. Em uma entrevista, prepare-se para responder sobre sua competência técnica e sua habilidade para trabalhar em equipe para conseguir criar coisas. As perguntas específicas que você deverá responder dependerão do tipo de cargo de engenharia que você está procurando, por exemplo, se é uma determinada disciplina da engenharia, como software, elétrica ou mecânica.
Principais perguntas de entrevista para engenheiro(a) e como respondê-las
Pergunta 1: Qual é o projeto de engenharia mais complicado no qual já trabalhou e o que você fez para garantir um resultado de sucesso?
Pergunta 2: Na sua função atual, que medidas você toma para evitar cometer erros?
Pergunta 3: Descreva uma situação na qual teve de lidar com um cliente ou alguma parte interessada difícil.
395,257 engenheiro interview questions shared by candidates
Find the min and max in an array. Now do it in less than 2n comparisons. (they were looking for the solution that finds both max and min in about 3/2 n comparisons).
Design patterns questions
Improve this piece of code, loop tracing, very basic printing problem
Write a function to modify a singly linked list, appending copies of the first N-1 elements to the end in reverse order. For example, ['A', 'B', 'C', 'D'] becomes ['A', 'B', 'C', 'D', 'C', 'B', 'A'].
There will be a meeting at New York and San Francisco offices. We will have to fly the participants to either one of these two offices. Let's say each office can accommodate half of the participants. Our goal is to assign each participant to an office in a way that the total travel cost for the company is minimized. What is this minimal cost? SF NY A 500 700 B 200 600 C 400 500 D 600 200 Output : 1400 (A:500 + B:200 + C:500 +D: 200)
Find an algorithm to find the largest sum subarray in an array of integers. (Better than O(n^2) ).
Questions were asked to check basic knowledge of OOPS concepts, String manipulation, Data Structures. Not very hard questions but were good enough to check concept.
Count bits in a byte.
Python questions: 1. Replace None value with previous value present in a list. 2. Given a ´dictionary, print the key for nth highest value present in the dict. If there are more than 1 record present for nth highest value then sort the key and print the first one. 3. Given two sentences, you have to print the words those are not present in either of the sentences.(If one word is present twice in 1st sentence but not present in 2nd sentence then you have to print that word too) 4. Forgot another question you have to pass all the cases, specially on edge cases. SQL questions: 1. Mostly % calculation, also refer the questions available here in Glassdoor. Next will be my Onsite Interview of 3.30hr. If anyone can help me on that or else I will update later on that interview as well.
Viewing 101 - 110 interview questions