How would you determine if someone has won a game of tic-tac-toe on a board of any size?
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 maximum sum of a sub-sequence from an positive integer array where any two numbers of sub-sequence are not adjacent to each other in the original sequence. E.g 1 2 3 4 5 6 --> 2 4 6
Phone interview 1 : a) Simulate a Queue with stacks ? b)Find repeated occurrence of character in a string ? Phone interview 2 : a) Given a 2D matrix of numbers find the position of number . Constraints of matrix number always in increasing order left to right and top to bottom . b)When should version control be used . And a tricky discreet math problem ?
One independent survey showed that 70% on people asked like coffee. Another independent survey showed that 80% of people like tea. What is the upper and lower bound of peoples who likes both coffee and tea
Given the daily values of a stock, find how you can lose the most with one buy-sell trading.
Given an array of integers eg [1,2,-3,1] find whether there is a sub-sequence that sums to 0 and return it (eg 1,2,-3 or 2,-3,1) Checking every sub-sequence is O(n^2) which is too inefficient
Function to compute the number of ways to climb a flight of n steps. Taking 1, 2, or 3 steps at a time. Do it in Linear time and constant space. n = 3. 1 1 1 1 2 2 1 3 Ans = 4
Just data structure and algorithms questions
Given a sorted matrix where the number below and right of you will always be bigger, write an algorithm to find if a particular number exist in the matrix. What is the running time of your algorithm.
You are trying to rob houses on a street. Each house has some +ve amount of cash. Your goal is to rob houses such that you maximize the total robbed amount. The constraint is once you rob a house you cannot rob a house adjascent to that house.
Viewing 41 - 50 interview questions