Skip to contentSkip to footer

Software Engineers Interview Questions

Salaries
Interviews

420,226 software engineers interview questions shared by candidates

However the interview was about Senior Java Position, I just asked a couple of questions about Java and nothing about Javascript. The interview questions were about: 1. Data structure and algorithms (30 minutes) 2. Operating Systems Concepts (System calls, concurrency, etc, Device Drivers.) 3. TCP/IP Layered protocol ( I was really really good at this when I was in college :) ) Till now about 1 hour or more passed from the 90 minutes interview... 4. Couple of questions about REST, Java Concurrency and Testing I could understand the emphasis on the OS, algorithms design and analysis is to be asked at Google & Amazon-like companies or to be asked to a fresh engineer he is just graduated from the university with a fresh knowledge. I am not denying their questions about OS, Data structure, and algorithms, but to make most on the interview for such topics and eventually got rejected because my knowledge in JavaScript is not enough is not honesty in reporting the Interview status. I answered the algorithms question and OS, TCP/IP from memory (which mostly wasn't that accurate as I left university more than 10 years back).
avatar

Senior Software Engineer

Interviewed at ING

4.1★
Jan 23, 2018

However the interview was about Senior Java Position, I just asked a couple of questions about Java and nothing about Javascript. The interview questions were about: 1. Data structure and algorithms (30 minutes) 2. Operating Systems Concepts (System calls, concurrency, etc, Device Drivers.) 3. TCP/IP Layered protocol ( I was really really good at this when I was in college :) ) Till now about 1 hour or more passed from the 90 minutes interview... 4. Couple of questions about REST, Java Concurrency and Testing I could understand the emphasis on the OS, algorithms design and analysis is to be asked at Google & Amazon-like companies or to be asked to a fresh engineer he is just graduated from the university with a fresh knowledge. I am not denying their questions about OS, Data structure, and algorithms, but to make most on the interview for such topics and eventually got rejected because my knowledge in JavaScript is not enough is not honesty in reporting the Interview status. I answered the algorithms question and OS, TCP/IP from memory (which mostly wasn't that accurate as I left university more than 10 years back).

Given a database, where we know some portion of data (e.g. say 20%) is accessed more than the other portion of the database by the client. We have a frontend that client requests data from. Design a data structure that will increase the efficiency of access of objects. And we know that we can only hold on to n elements in memory.
avatar

Software Development Engineer

Interviewed at Microsoft

4★
Aug 2, 2014

Given a database, where we know some portion of data (e.g. say 20%) is accessed more than the other portion of the database by the client. We have a frontend that client requests data from. Design a data structure that will increase the efficiency of access of objects. And we know that we can only hold on to n elements in memory.

Given an array of unique non-negative integers, {A1,…,An}, and a positive integer, X, write a function that finds all pairs of numbers in the array that sum to X”. You are given an integer array nums sorted in ascending order (with distinct values), and an integer target. Suppose that nums is rotated at some pivot unknown to you beforehand (i.e., [0,1,2,4,5,6,7] might become [4,5,6,7,0,1,2]).” Take a singly-linked list, and reorder in such a way that the first element points to the last element, second element points to second-to-last element, and so on.
avatar

Software Engineer

Interviewed at Expedia Group

3.7★
Feb 1, 2021

Given an array of unique non-negative integers, {A1,…,An}, and a positive integer, X, write a function that finds all pairs of numbers in the array that sum to X”. You are given an integer array nums sorted in ascending order (with distinct values), and an integer target. Suppose that nums is rotated at some pivot unknown to you beforehand (i.e., [0,1,2,4,5,6,7] might become [4,5,6,7,0,1,2]).” Take a singly-linked list, and reorder in such a way that the first element points to the last element, second element points to second-to-last element, and so on.

Viewing 1521 - 1530 interview questions

Glassdoor has 420,226 interview questions and reports from Software engineers interviews. Prepare for your interview. Get hired. Love your job.