Question Description: Write a function that, given a list of integers (both positive and negative) returns the sum of the contiguous subsequence with maximum sum. Thus, given the sequence (1, 2, -4, 1, 3, -2, 3, -1) it should return 5.
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,371 engenheiro interview questions shared by candidates
Write a program that given 4 coin denominations and a dollar amount finds the best way to express that amount using the coins given. I.e. you have coins with denominations of 1c, 7c, 13c,19c and you have to express $2.12 with the least number of coins. There is always a 1c coin but the other 3 are arbitrary.
why are you choosing our company?
Behavioral Why outreach The impact you hope to have from your next role?What is most important factor in your career/job What do you think about RSpec? How do you compare it with other frameworks What was the hardest/Challenging technical problem you faced and how did you resolve it Coding This problem concerns finding a time when we can do daily recurring maintenance on a server. You are to write a function that is given the following information: List of times when the server is busy every day Duration, in minutes, of the desired maintenance window The function should return the start time of a daily maintenance window when the server is not busy. In pseudo-code, the function signature would look something like this: maintWindowStart(busyTimes, durationMins) -> startTime The "busy times" should be time ranges like the following, and can be represented in whatever data structure you feel is appropriate. 0:05 to 0:30 = [5, 30] 2:00 to 4:01 = [120, 241] 13:10 to 16:55 = [790, 1015] [[5, 30], [120, 541], [790, 1015]] // requested duration -> expected start time // 10 -> 30 // 120 -> 541 // 4 -> 0 // 300 -> 1015
Check whether the string is symmetric, how to test your result
Implement a base 3 adder which takes two strings as input and returns a string
The implementation question: Find a max and min in an array simaltaneously. I used a 2n comparisons approach and a 1.5n on-average approach.
Remove a node from a singly linkedlist without knowing the head node. All you have is the node itself.
Search a max value in an unsorted array. (Very abstract question) in better than O(n).
Given a set of strings, a number 'n', and a function that takes a string and gives back a score, find the n largest scored strings in the set.
Viewing 281 - 290 interview questions