Given two unsorted arrays, one with event start times and one with end times, find out if any two events overlap.
Ingegnere Interview Questions
Ingegnere Interview Questions
Gli ingegneri sono responsabili della progettazione e della realizzazione di prodotti. Durante un colloquio di lavoro, aspettati di ricevere domande sulle tue competenze tecniche e di essere valutato per la tua capacità di lavorare in team alla creazione e realizzazione di oggetti. Le domande specifiche che ti verranno poste dipenderanno dal tipo di ruolo tecnico per il quale ti stai candidando, ad esempio una specifica disciplina ingegneristica come software engineer, ingegnere elettrico o ingegnere meccanico.
Domande tipiche dei colloqui per Ingegnere e come rispondere
Domanda 1: Qual è il progetto di ingegneria più impegnativo al quale hai partecipato e come sei riuscito a garantirne il successo?
Domanda 2: Nel tuo ruolo attuale, quali misure adotti per evitare di commettere errori?
Domanda 3: Descrivi una volta in cui hai dovuto gestire un cliente o un interlocutore difficile.
375,404 ingegnere interview questions shared by candidates
You are given a list of strings (e.g. ["cat", "dog", "hat", "apple", "c"] ). Write a program that would take as input a string containing a wild card character, like "*at", "**t" (could be "cat", "hat", "bat"), "ca*", etc. and return true if there is a corresponding string in the list, and false otherwise.
You have 8 balls. All are identical except one is slightly heavier. You have a balance. What is the minimum number of weighings required to find the heavier ball?
Describe a function (in C) that does the following Input : an integer. Output: if that integer is 4, the function returns 7. if that integer is 7, the function returns 4. constraints: the input is SURE to be either 4 or 7. no need to validate. you are not allowed to use any condition/flow commands (if, switch, while, for, trinary operator...) you are not allowed to use any external library or import anything (like math..) you are not allowed to use %(modulu), * (multiplication)
reverse bits of an integer that is a power of 2 , keeping complexity in mind.
How many unique paths are there from B-L point to the T-R point of a chess table? What would be your approach to calculate this?
A box is divided into 4 boxes which is further subdivided into 4 boxes and so on. What is the best Data structure suitable for this scenario?
Given an integer array, write a program that returns an array with elements = product of the integers in input array except the one in its position. Ex: Given input: [2, 3, 10, 4, 5], output: [600, 400, 120, 300, 240] What is the complexity of your program? When will your program not work? Below is what I presented (O(n)), but it did not qualify me for the next round.
If a batsman given super powers so that he can hit any run[6,4 ,etc] and he wants to score highest run for himself , how he'll do that in 50 over game?
Given a collection of numbers, it has two functions: insert() and getMedian(). Choose a data structure to construct this collection and design the insert() and getMedian() function. Explain the time complexity of each function.
Viewing 431 - 440 interview questions