Unexpected: Puzzle question. If you have 2 eggs, and you want to figure out what's the highest floor from which you can drop the egg without breaking it, how would you do it? What's the optimal solution?
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,141 engenheiro interview questions shared by candidates
GIven 9 balls all of which weigh the same except for one, what is the minimum of weighings necessary to find the ball weighs more (or less).
Question was "Given a pattern and a string input - find if the string follows the same pattern and return 0 or 1. Examples: 1) Pattern : "abba", input: "redblueredblue" should return 1. 2) Pattern: "aaaa", input: "asdasdasdasd" should return 1. 3) Pattern: "aabb", input: "xyzabcxzyabc" should return 0.
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?
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
How many bottles of shampoo are produced in the world a year?
implement the dynamic polymorphism
The final round of interview was challenging in terms of how you pick scenarios from your career.
Write an algorithm to determine whether a given number is of the form (2^n)+1, where n is an integer.
Viewing 11 - 20 interview questions