Skip to contentSkip to footer

Engenheiro De Software Interview Questions

Salaries
Interviews

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

Question 1

Pergunta 1: Como você descreve seu processo de programação?

How to answer
Como responder: Ao responder a perguntas relacionadas ao seu processo ou ciclo de desenvolvimento e engenharia de software, considere todas as etapas, começando pela obtenção dos requisitos para o produto final. Inclua o máximo de detalhes possível para ajudar os entrevistadores a entender seu trabalho como engenheiro(a) de software e como você mostra sua capacidade de trabalhar em projetos do início ao fim.
Question 2

Pergunta 2: Quais linguagens de programação você conhece e prefere?

How to answer
Como responder: Os entrevistadores querem saber com quais linguagens de programação você tem familiaridade e quais prefere. Essa pergunta não tem, necessariamente, resposta certa ou errada, mas fornece insights das suas capacidades e do seu conhecimento de codificação. Se a vaga for voltada para uma linguagem específica, inclua-a ao falar sobre as linguagens que você conhece.
Question 3

Pergunta 3: Dê um exemplo de um projeto bem-sucedido que você tenha concluído.

How to answer
Como responder: Ao descrever seu sucesso em um projeto, identifique aspectos que deram certo e detalhe os diferentes elementos da lista de tarefas. Você pode descrever a equipe com a qual trabalhou no projeto, como você gerenciou seu tempo e como contribuiu para o projeto.

419,753 engenheiro de software interview questions shared by candidates

Suppose that you earn 100% annual interest (APY) on $1 initial deposit. How long before you'll be as rich as Bill Gates ($63 billion)? Given a number, e.g., 314159, as an array [3,1,4,1,5,9], increment it: change it to [3,1,4,1,6,0].
avatar

Software Engineer

Interviewed at Google

4.4★
Feb 12, 2013

Suppose that you earn 100% annual interest (APY) on $1 initial deposit. How long before you'll be as rich as Bill Gates ($63 billion)? Given a number, e.g., 314159, as an array [3,1,4,1,5,9], increment it: change it to [3,1,4,1,6,0].

you have a sequence where each number is a multiple of 2 or 5 (so: 2^i * 5^j). he gave the beginning of the sequence as 1,2,3,4,5,8,10,16... and asked me to find an algorithm to calculate the next number in the sequence.
avatar

Software Engineer

Interviewed at Google

4.4★
Mar 10, 2010

you have a sequence where each number is a multiple of 2 or 5 (so: 2^i * 5^j). he gave the beginning of the sequence as 1,2,3,4,5,8,10,16... and asked me to find an algorithm to calculate the next number in the sequence.

1. Phone interview - Sort the characters in string by frequency and then by their alphabetical order. Example - bbaaccc -> cccaabb 2. The question that screwed me - given array is [0,1,1,0,1,1,1] ; output should be [0,1,1,0,1,2,3] ie., for every non-zero element in array, find its distance to the nearest zero in O(n) time. i would definitely encourage the candidates who read this post to share their solution for this question. 3. In order traversal of Binary search tree related (the solution is to start from right sub tree).
avatar

Software Engineer

Interviewed at Bloomberg

4★
Dec 29, 2016

1. Phone interview - Sort the characters in string by frequency and then by their alphabetical order. Example - bbaaccc -> cccaabb 2. The question that screwed me - given array is [0,1,1,0,1,1,1] ; output should be [0,1,1,0,1,2,3] ie., for every non-zero element in array, find its distance to the nearest zero in O(n) time. i would definitely encourage the candidates who read this post to share their solution for this question. 3. In order traversal of Binary search tree related (the solution is to start from right sub tree).

If your are given an Integer Singly linked list. Print it backwards. Constraints: 1. Do not manipulate the list. (example: do not make it a doubly linked list, do not add or delete elements, do not change any memory location of any element) 2. O(n) < time < O(n^2) 3. O(1) < space < O(n)
avatar

Software Engineer

Interviewed at Meta

3.6★
Jan 11, 2017

If your are given an Integer Singly linked list. Print it backwards. Constraints: 1. Do not manipulate the list. (example: do not make it a doubly linked list, do not add or delete elements, do not change any memory location of any element) 2. O(n) < time < O(n^2) 3. O(1) < space < O(n)

Given a set of numbers -50 to 50, find all pairs that add up to a certain sum that is passed in. What's the O notation for what you just wrote? Can you make it faster? Can you find an O(n) solution? Implement the O(n) solution
avatar

Software Development Engineer In Test (SDET)

Interviewed at Microsoft

4★
Mar 17, 2011

Given a set of numbers -50 to 50, find all pairs that add up to a certain sum that is passed in. What's the O notation for what you just wrote? Can you make it faster? Can you find an O(n) solution? Implement the O(n) solution

Viewing 31 - 40 interview questions

Glassdoor has 419,753 interview questions and reports from Engenheiro de software interviews. Prepare for your interview. Get hired. Love your job.