Software Engineer Interviews

Software Engineer Interview Questions

Software engineers write programs to design and develop computer software. Interviews are highly technical, so come ready to work through coding problems and math brainteasers. The specific questions you are asked will depend on what type of programming position you are looking for. Try researching a specific software discipline such as web development, application development, or system development.

Top Software Engineer Interview Questions & How to Answer

Question 1

Question #1: How would you describe your programming task process?

How to answer
How to answer: When answering a question about your process or life cycle for software development and engineering, it's helpful to consider every step, beginning with obtaining the requirements for the end product. Include as much detail as possible to help the interviewer learn more about any work you've done as a software engineer and how you handle a task to show your ability to tackle a project from start to finish.
Question 2

Question #2: Which programming languages do you know and prefer?

How to answer
How to answer: An interviewer will want to know what programming languages you're familiar with, as well as which languages you prefer. This question doesn't necessarily have a right or wrong answer, but it does provide insights into your capabilities and coding expertise. If the job listing for which you are interviewing includes specific language knowledge preferences, make sure to include them when outlining the software languages you know.
Question 3

Question 3: What is an example of a successful project that you completed?

How to answer
How to answer: When describing your success with a past project, it's helpful to identify aspects of the project that went well and detail the different task list elements. You can describe the team with whom you worked on the project, how you managed your time, and how you specifically contributed to the project.

419,183 software engineer interview questions shared by candidates

Two sorted arrays. you can start from any one them, and then at common element you may or may not jump to other array. Continue in this manner till you reach the end of an array. Find the path that results the maximum sum.
avatar

Software Development Engineer II

Interviewed at Amazon

3.5
Oct 4, 2012

Two sorted arrays. you can start from any one them, and then at common element you may or may not jump to other array. Continue in this manner till you reach the end of an array. Find the path that results the maximum sum.

Given an integer, re-arrange the integer such that first and last digit will be at first and second, second and second last digit will be at third and fourth position from left of the re-arranges integer and so on. Example: Input -> 12345678, Output -> 18273645 Input -> 1234567, Output -> 1726354
avatar

Software Engineer, Backend

Interviewed at Zalando

3.6
Jan 9, 2019

Given an integer, re-arrange the integer such that first and last digit will be at first and second, second and second last digit will be at third and fourth position from left of the re-arranges integer and so on. Example: Input -> 12345678, Output -> 18273645 Input -> 1234567, Output -> 1726354

1. Given an array of n integers. Derive an array where the value of the element at index i is the product of elements in the given array except element i in the given array. The complexity should be O(n). 2. How to traverse timing graph starting from the input nodes? Data structure of the nodes in the graph is given. Write a C program for it. 3. Implement C++ hashing function.
avatar

Software Engineer

Interviewed at Intel Corporation

3.9
Dec 1, 2017

1. Given an array of n integers. Derive an array where the value of the element at index i is the product of elements in the given array except element i in the given array. The complexity should be O(n). 2. How to traverse timing graph starting from the input nodes? Data structure of the nodes in the graph is given. Write a C program for it. 3. Implement C++ hashing function.

Given a list of transactions, How can we calculate the frequency counts of all possible item-sets? For example, Input: ID Purchased Items 1 apple, banana, lemon 2 banana, berry, lemon, orange 3 banana, berry, lemon Output: Itemset Frequency apple, banana 1 apple, lemon 1 banana, berry 2 banana, lemon 3 ... apple, banana, lemon 1 banana, berry, lemon 2 ... banana, berry, lemon, orange 1
avatar

Software Engineer

Interviewed at Atlassian

3.2
Jun 19, 2017

Given a list of transactions, How can we calculate the frequency counts of all possible item-sets? For example, Input: ID Purchased Items 1 apple, banana, lemon 2 banana, berry, lemon, orange 3 banana, berry, lemon Output: Itemset Frequency apple, banana 1 apple, lemon 1 banana, berry 2 banana, lemon 3 ... apple, banana, lemon 1 banana, berry, lemon 2 ... banana, berry, lemon, orange 1

Viewing 861 - 870 interview questions

Glassdoor has 419,183 interview questions and reports from Software engineer interviews. Prepare for your interview. Get hired. Love your job.