Software Development Engineer I Interview Questions

1,214 software development engineer i interview questions shared by candidates

Second Round (F2F):(1:30hr) 1) Find LCA in BST. 2) Find LCA in Binary Tree. 3) Given a binary tree where each node contains three pointers left,right,succ, where succ pointer is pointing to any of its successor node , the question is if any of succ pointer is pointing to its predecessor node then make that pointer NULL. 4) Given an array that represents the runs scored by a batsman and we have given the total score ,now we have to find out in how many ways can batsman score the run. Ex – arr = {2,3,1} total run = 4 2+1+1 = 4, 3+1 = 4, 2+2 = 4, 1+3 = 4, 2+1+1 = 4 and many more. First I have given the recursive solution than interview asked me dp solution, I told him DP approach he was satisfied. 5) Find Loop in a linked list and remove it. 6) You have 100 songs to play in a shuffling mode how will you play. Interview want full working code for each question for last question he wanted only approach.
avatar

Software Development Engineer I

Interviewed at Amazon

3.5
Aug 17, 2015

Second Round (F2F):(1:30hr) 1) Find LCA in BST. 2) Find LCA in Binary Tree. 3) Given a binary tree where each node contains three pointers left,right,succ, where succ pointer is pointing to any of its successor node , the question is if any of succ pointer is pointing to its predecessor node then make that pointer NULL. 4) Given an array that represents the runs scored by a batsman and we have given the total score ,now we have to find out in how many ways can batsman score the run. Ex – arr = {2,3,1} total run = 4 2+1+1 = 4, 3+1 = 4, 2+2 = 4, 1+3 = 4, 2+1+1 = 4 and many more. First I have given the recursive solution than interview asked me dp solution, I told him DP approach he was satisfied. 5) Find Loop in a linked list and remove it. 6) You have 100 songs to play in a shuffling mode how will you play. Interview want full working code for each question for last question he wanted only approach.

Q. Reverse K alternate nodes in a linked list. Q. BST of a binary tree using arrays and without it Q. Given two strings, find the minimum length in which all the characters of the smaller string can be found in the bigger string. Also, give the indexes. I was out after the 1st technical Interview
avatar

Software Development Engineer I

Interviewed at Amazon

3.5
Aug 24, 2015

Q. Reverse K alternate nodes in a linked list. Q. BST of a binary tree using arrays and without it Q. Given two strings, find the minimum length in which all the characters of the smaller string can be found in the bigger string. Also, give the indexes. I was out after the 1st technical Interview

Q1) Reverse a singly linked list. Q2) Find if String A contains String B. Q3) Design a cache system on the local machine and on cloud to handle 1000's of images on cloud. Such that it takes minimum response time to respond to user query.
avatar

Software Development Engineer I Intern

Interviewed at Amazon

3.5
Aug 21, 2015

Q1) Reverse a singly linked list. Q2) Find if String A contains String B. Q3) Design a cache system on the local machine and on cloud to handle 1000's of images on cloud. Such that it takes minimum response time to respond to user query.

there are a number of vendors who supply a number of items. two or more vendors can supply same item. As input, an array of venders and items in the form of <vendorID, itemID>. you need to write a function called findVendersWithMaxDuplicates() to output an array of vendorID with maximum duplicate item. Function should be logical and optimized for time.
avatar

Software Development Engineer I

Interviewed at Amazon

3.5
Sep 12, 2015

there are a number of vendors who supply a number of items. two or more vendors can supply same item. As input, an array of venders and items in the form of <vendorID, itemID>. you need to write a function called findVendersWithMaxDuplicates() to output an array of vendorID with maximum duplicate item. Function should be logical and optimized for time.

Viewing 1171 - 1180 interview questions

Glassdoor has 1,214 interview questions and reports from Software development engineer i interviews. Prepare for your interview. Get hired. Love your job.