Desenvolvedor De Software Interview Questions

Desenvolvedor De Software Interview Questions

A área de desenvolvimento de projetos está em alta e oferece bons salários e realização profissional. Em entrevistas para cargos de desenvolvimento de software, são normalmente feitas perguntas relacionadas às suas habilidades técnicas e comportamentais e a como você gerencia projetos de maneira eficiente.

Principais perguntas de entrevista para desenvolvedor(a) de software e como respondê-las

Question 1

Pergunta 1: Com qual tipo de desenvolvimento de software você trabalha no momento?

How to answer
Como responder: Ao responder a perguntas relacionadas aos seus projetos atuais de desenvolvimento de software, enfatize as linguagens de codificação e a pilha de tecnologia que você usa. Essa pergunta ajuda os entrevistadores a determinar se você tem as habilidades necessárias para lidar com a carga de trabalho.
Question 2

Pergunta 2: Descreva um problema de desenvolvimento que você tenha tido e como o solucionou.

How to answer
Como responder: Ao falar sobre situações específicas, você consegue descrever seus métodos de solução de problemas e as medidas tomadas para resolver o problema. Use o método STAR (Situação, Tarefa, Ação, Resultado) para explicar o problema e o que você fez para resolvê-lo de forma clara.
Question 3

Pergunta 3: Como é seu processo de garantia de qualidade?

How to answer
Como responder: A garantia de qualidade é um aspecto importante do desenvolvimento de software, e o processo pode ser realizado por desenvolvedores em organizações menores que não têm uma equipe própria para isso. Ao fazer perguntas relacionadas ao processo de garantia de qualidade, os entrevistadores querem determinar sua disposição e seu preparo para trabalhar com testes e correção de erros.

93,114 desenvolvedor de software interview questions shared by candidates

I have a log that consists of more than 100 million lines. Each line is just a data about user login, login time, etc. I want to sort them based on user login, and then if there is a tie based on login time, etc. However, I have limited memory, so don't think of storing all of them in an array. The memory can only hold n data where n is much smaller than 100 millions. You can access the disk though although it is much slower. How will you do it so that it is as efficient as possible?
avatar

Software Developer

Interviewed at Epic

3.3
Aug 29, 2009

I have a log that consists of more than 100 million lines. Each line is just a data about user login, login time, etc. I want to sort them based on user login, and then if there is a tie based on login time, etc. However, I have limited memory, so don't think of storing all of them in an array. The memory can only hold n data where n is much smaller than 100 millions. You can access the disk though although it is much slower. How will you do it so that it is as efficient as possible?

how would you design how a cellphone implements its contact list when you press a certain letter. For example, If you press M it will tell you all the names starting with M. then if you press MI it will tell you all names starting from MI and so forth....
avatar

Amazon Software Developer Intern

Interviewed at Amazon

3.5
Apr 1, 2011

how would you design how a cellphone implements its contact list when you press a certain letter. For example, If you press M it will tell you all the names starting with M. then if you press MI it will tell you all names starting from MI and so forth....

We have a log file, can grow pretty big. Each line is a trace-log, and the first field is the RequestID. We need to scan the file, and print all the logs for requests which resulted in error .. 001 <timestamp> BEGIN 001 <timestamp> fetched from db 001 <timestamp> some processing .. 002 <timestamp> BEGIN .. 002 <timestamp> fetched from db 001 <timestamp> returned success 003 <timestamp> BEGIN 001 <timestamp> END 003 <timestamp> some work 002 <timestamp> ERROR 003 <timestamp> some other work
avatar

Software Developer

Interviewed at Booking.com

4.1
Mar 30, 2017

We have a log file, can grow pretty big. Each line is a trace-log, and the first field is the RequestID. We need to scan the file, and print all the logs for requests which resulted in error .. 001 <timestamp> BEGIN 001 <timestamp> fetched from db 001 <timestamp> some processing .. 002 <timestamp> BEGIN .. 002 <timestamp> fetched from db 001 <timestamp> returned success 003 <timestamp> BEGIN 001 <timestamp> END 003 <timestamp> some work 002 <timestamp> ERROR 003 <timestamp> some other work

Short coding : 1. They gave an array A with N elements we need to find if addition of two elements in the array will be the element K Ex: I/P: a[5]={7,3,2,6,4,} K=10; Op:7+3=10 6+4=10 2. Two sorted array a[],b[] will be given we need to merge the array without temporary array. 3. An array arr[] with elements are given we need to sort the odd number in descending on left side and the even numbers in ascending on the right side of the array Ex: I/P: arr[5]={7,4,3,5,2} O/P:7 5 3 2 4
avatar

Software Developer

Interviewed at Zoho

4.2
Feb 17, 2019

Short coding : 1. They gave an array A with N elements we need to find if addition of two elements in the array will be the element K Ex: I/P: a[5]={7,3,2,6,4,} K=10; Op:7+3=10 6+4=10 2. Two sorted array a[],b[] will be given we need to merge the array without temporary array. 3. An array arr[] with elements are given we need to sort the odd number in descending on left side and the even numbers in ascending on the right side of the array Ex: I/P: arr[5]={7,4,3,5,2} O/P:7 5 3 2 4

You are given an array of integers, a1, that have sequential integers 1 through n. ( { 1,2,3,4,5 } or { 1,2,3 } or any other array) You are also given an array of integers, a2, that also have numbers 1 through n, but are not in sequential order and are missing one of the numbers between 1 and n. Find the missing number in a2. Did you check for special cases? Can you do this in O(n) runtime?
avatar

Software Developer Intern

Interviewed at Redfin

3.5
Feb 19, 2016

You are given an array of integers, a1, that have sequential integers 1 through n. ( { 1,2,3,4,5 } or { 1,2,3 } or any other array) You are also given an array of integers, a2, that also have numbers 1 through n, but are not in sequential order and are missing one of the numbers between 1 and n. Find the missing number in a2. Did you check for special cases? Can you do this in O(n) runtime?

Viewing 81 - 90 interview questions

Glassdoor has 93,114 interview questions and reports from Desenvolvedor de software interviews. Prepare for your interview. Get hired. Love your job.