Software Development Engineer Ii Interview Questions

2,268 software development engineer ii interview questions shared by candidates

Interview Questions 1st interview Sr SDE class Node{ int nodeId,int nodeParentId} is given. Input : List<Node> Output:Tree 2nd Interview SDE Design TIC TAC TOE problem 3rd Interview SDE II Lunch interview 1.Move all zeros to beginning input {1,2,3,0,0,0,4,5} output {0,0,0,1,2,3,4,5} 2. Given an int[] multiply all numbers except index I/p {1,2,3,4} O/P {24,12,8,6} 4th Interview SDE II Log file contains UserId.Every day has new log file.Given range of n days find top 10 users? 5th Interview Director tech Asked two puzzles 1.3 bulbs and switch board outside room.Find which switch belongs to which bulb in one pass 2.10 Bags with 100 gold coins each. Each coin weighs 10 gms in 9 bags and each coin weighs 9 gms in one bag find out which bag has coins of 9 gms in one weight?
avatar

Software Development Engineer II

Interviewed at Expedia Group

3.7
May 23, 2015

Interview Questions 1st interview Sr SDE class Node{ int nodeId,int nodeParentId} is given. Input : List<Node> Output:Tree 2nd Interview SDE Design TIC TAC TOE problem 3rd Interview SDE II Lunch interview 1.Move all zeros to beginning input {1,2,3,0,0,0,4,5} output {0,0,0,1,2,3,4,5} 2. Given an int[] multiply all numbers except index I/p {1,2,3,4} O/P {24,12,8,6} 4th Interview SDE II Log file contains UserId.Every day has new log file.Given range of n days find top 10 users? 5th Interview Director tech Asked two puzzles 1.3 bulbs and switch board outside room.Find which switch belongs to which bulb in one pass 2.10 Bags with 100 gold coins each. Each coin weighs 10 gms in 9 bags and each coin weighs 9 gms in one bag find out which bag has coins of 9 gms in one weight?

The most difficult question was to find the maximum contiguous subsequence in a bar chart. I was able to find a solution in O(N^3) which is basically the brute force method The idea is that given a bar chart with peaks and valley's, you should find the subsequence X which gives you the maximum area underneath the chart. For the life of me I couldn't think of the answer at the time, , I had a hard time visualizing it, however it's a classical computer science problem called "the maximum sum contiguous subsequence problem."
avatar

Software Development Engineer II

Interviewed at Amazon

3.5
Feb 7, 2013

The most difficult question was to find the maximum contiguous subsequence in a bar chart. I was able to find a solution in O(N^3) which is basically the brute force method The idea is that given a bar chart with peaks and valley's, you should find the subsequence X which gives you the maximum area underneath the chart. For the life of me I couldn't think of the answer at the time, , I had a hard time visualizing it, however it's a classical computer science problem called "the maximum sum contiguous subsequence problem."

Viewing 2171 - 2180 interview questions

Glassdoor has 2,268 interview questions and reports from Software development engineer ii interviews. Prepare for your interview. Get hired. Love your job.