An array has negative and positive numbers. Separate the numbers such that negative numbers are at the beginning and positive numbers at the end without changing the order. You cannot sort it. Explain with O(1) space
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.
420,420 engenheiro de software interview questions shared by candidates
We're playing a game of Russian Roulette. I take 2 consecutive bullets out of the 6 bullet revolver and spin the chamber. I go first and shoot the bullet at my head, which misses. I then pass the gun to you, where you have the option of spinning the chamber, or shooting. Which would you do to maximize your probability of not dieing?
Write a code to convert an ASCII representation of a positive integer to it's numeric value.
Say you use SVN for source control..you have several revisions of a file...R1, r2, r3..etc..Someone checked in a bug and the revision became bad..need t find the first bad revision..gave a function findBadRevision(int goodRevision, int badRevision) so for e.g the revisions were GGBB and function passes in 0,4 so the first bad revision is 2. There exists a function boolean hasBug(int revision) which will tell us if a certain revision has a bug. can assume good revision < bad revision
O(n) time O(1) space to print link list reversely.
One question 3 of the interviewers asked me was "What was the most difficult thing you had to deal with.".
1. Give you a data structure Seq class Sqe { int value; Seq nex; } and give you two Seq object seq., seq., compare two objects, return true if there is only one difference or no difference, false if more than two differences. 2. Giving a array which has zero and no-zero elements, move all zero elements to the end and no-zero elements to the begin.
Given a string 12345 and a alphabet to number mapping like a =1, b =2.., y=25, z=26 write a code to find number of possible alphabet strings from the given string. E.x. string 12345 has possible alphabet strings as {lcde,awde, abcde}.
How do you find sequences of consequtive integers in a list that add to a particular number.
Write a function that finds the minimum and maximum values within an unsorted array using divide-and-conquer.
Viewing 371 - 380 interview questions