Software Development Engineer I Interview Questions

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

Round I(Telephonic): 1. Given a warehouse and tasks which are dependent on other tasks write the sequence of the tasks. 2. Given two unknowns in a valid parenthesis question how would you decide if it is valid or not. Round II(Telephonic): 1. Print nodes at a distance k from a given node. 2. Clone a linked list with random pointers. 3. Add two numbers represented as linked lists. Round III(F2F): 1. Given 1 represents A, 2 represents B,....., 26 represents Z, find the possible character strings for a given number 12345. 2. Implement queue using stack. Round IV(F2F): 1. Find the height of a tree iteratively. 2. Find the edge in a binary tree such that cutting the edge would give two binary trees with the same number of nodes. Round V(F2F): 1. Given a sorted array with each value occurring twice except one. Find the element in less than O(n). 2. Variation of a 0/1 Knapsack problem. After answering this, the problem was modified to the case where one has to find an optimal solution given that you can double the value of a given element of your choice to get the maximum value.
avatar

Software Development Engineer I

Interviewed at Amazon

3.5
Apr 12, 2017

Round I(Telephonic): 1. Given a warehouse and tasks which are dependent on other tasks write the sequence of the tasks. 2. Given two unknowns in a valid parenthesis question how would you decide if it is valid or not. Round II(Telephonic): 1. Print nodes at a distance k from a given node. 2. Clone a linked list with random pointers. 3. Add two numbers represented as linked lists. Round III(F2F): 1. Given 1 represents A, 2 represents B,....., 26 represents Z, find the possible character strings for a given number 12345. 2. Implement queue using stack. Round IV(F2F): 1. Find the height of a tree iteratively. 2. Find the edge in a binary tree such that cutting the edge would give two binary trees with the same number of nodes. Round V(F2F): 1. Given a sorted array with each value occurring twice except one. Find the element in less than O(n). 2. Variation of a 0/1 Knapsack problem. After answering this, the problem was modified to the case where one has to find an optimal solution given that you can double the value of a given element of your choice to get the maximum value.

Viewing 451 - 460 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.