If you have an unsorted array of numbers from 1-100, except 1 of those numbers is missing, how do you determine which number is missing
Engenheiro De Software Interview Questions
Engenheiro De Software Interview Questions
Engenheiros de software criam programas para desenvolver softwares de computador. As entrevistas são altamente técnicas. Portanto, prepare-se para resolver problemas de codificação e de matemática. As perguntas específicas que são feitas dependem do tipo de programação exigido na vaga. Pesquise sobre uma área específica de software, como desenvolvimento web, desenvolvimento de aplicativos ou desenvolvimento de sistemas.
Principais perguntas de entrevista para engenheiro(a) de software e como respondê-las
Pergunta 1: Como você descreve seu processo de programação?
Pergunta 2: Quais linguagens de programação você conhece e prefere?
Pergunta 3: Dê um exemplo de um projeto bem-sucedido que você tenha concluído.
419,753 engenheiro de software interview questions shared by candidates
Print a binary tree by vertical level order like 1 2 4 3 5 print : 3 2 1 5 4
Given a string find the first non-repeated character.
given an array of numbers to remove the duplicates
The questions were not very difficult but you really need to have all the concepts crystal-clear and be ready to apply them successfully. One of the questions was "how to count the letters in this string:" "The quick brown fox jumps over the lazy dog";
Phone interview question: Given a string pattern of 0s, 1s, and ?s (wildcards), generate all 0-1 strings that match this pattern. e.g. 1?00?101 -> [10000101, 10001101, 11000101, 11001101]. You can generate the strings in any order that suits you.
If you had a list of appointments (each appointment has a begin time, an end time, and a boolean hasConflict), how would you efficiently go through them and set the hasConflict boolean for each. You cannot assume they are sorted in any way. Keep in mind that one appointment may be very long, etc.
Given an array with length n-1 which contains integers of the range 1 to n. Each element is distinct and appears only once. One integer is missing. Find the missing integer in linear time using O(1) memory. Now two integers are missing, find them out in linear time using O(1) memory. How about three?
Given n sets of choices: (1,2,3), (2,3,4), (4,5) You pick one element from each set of choices. Generate all possible picking.
Consider an X x Y array of 1's and 0s. The X axis represents "influences" meaning that X influences Y. So, for example, if $array[3,7] is 1 that means that 3 influences 7. An "influencer" is someone who influences every other person, but is not influenced by any other member. Given such an array, write a function to determine whether or not an "influencer" exists in the array.
Viewing 81 - 90 interview questions