Software development engineer i Interview Questions

1K

Software Development Engineer I interview questions shared by candidates

Top Interview Questions

Sort: Relevance|Popular|Date
Amazon
Software Development Engineer I Intern was asked...January 24, 2017

non disclosure agreement

18 Answers

I don't actually know. I mean, that's what I would do if I were amazon, but I did not read anything about them webcamming me, and I also didn't happen to notice the webcam light being on. That didn't mean it didn't happen, though. Less

I took the test in c++. The function interfaces were in base c, though, so it would probably look more or less identical in c or java. Less

Yeah, it was for me. There was few days pause between the 2nd round and the offer, so maybe they looked at other parts of my resume and decided to forgo a 3rd round for me. So I really can't say for sure that you won't have more rounds. Less

Show More Responses
Amazon

What was one of your best achievements on a project in the past?

18 Answers

From what i've heard and seen, just wait, following up will barely do you any good. Less

Hey, I just have one question out of curiosity, was the second online assessment web-cam proctored? Less

i heard amazon is changing their recruiting process. Many people complained that the online proctoring was an invasion of their privacy. I also had a second online assessment but it was not webcam proctored. I am assuming the recruiting process is now two online non webcam assessments then a final phone interview. My friend had that round of interviews with Amazon 2 weeks ago. Less

Show More Responses
Amazon

DS, Algorithms.

18 Answers

Review Leetcode, CTCI.

Hi, did you interview on Jan 27? Did the engineer ask about behavioral questions or resume questions or did they just jump right into the coding questions? Also I finished my second assessment a week ago but still didn't get a reply back. Was that normal for you? Less

Hi, did you interview on Jan 27? Did the engineer ask about behavioral questions or resume questions or did they just jump right into the coding questions? Also I finished my second assessment a week ago but still didn't get a reply back. Was that normal for you? Less

Show More Responses
Amazon

I signed NDA for online assessments. For the phone interview, questions about DS and string manipulation. Should be good if can solve medium level HackerRank or Leetcode problems.

6 Answers

It took them around 2 weeks to come back to me for the phone interview.

Hey Brother, Brilliant article, glad I slogged through the Amazon it seems that a whole lot of the details really come back to from my past project. AWS Tutorial I'm using CloudFormation and really enjoy it, but there are a couple of things which are lacking here. Maybe there are some reasons why they weren't implemented here, but. So, the first thing is variables which can be populated during stack creation. Here is an example of similar service from another cloud provider: Thanks a lot. This was a perfect step-by-step guide. Don’t think it could have been done better. Shukran, Radhey Less

Szia, Grazie! Grazie! Grazie! Your blog is indeed quite interesting around Interview Question! I agree with you on lot of points! I'm a tutor at a college in NZ trying to use AWS educate to teach my students how to set up a webserver and your admin approval system that we use to confirm access to the students is broken. It also enables customers to reduce the administrative burdens of operating and scaling storage to AWS, AWS Training USA so they don’t have to worry about capacity planning, hardware provisioning, data replication, hardware failure detection and recovery, or time-consuming hardware migrations. Excellent tutorials - very easy to understand with all the details. I hope you will continue to provide more such tutorials. Regards, Kevin Less

Show More Responses
Amazon

Signed an NDA, so I will not post the questions.

6 Answers

Heard back within 4 days after the final interview. I answered both questions and passed the test cases provided on the second assessment. The questions asked in the final interview are certainly solvable, but I had some trouble coding my solution for two out of the three problems. Less

What day did you interview? I interviewed feb 9 but still did not hear back.

I interviewed on Feb 10th, and heard back yesterday.

Show More Responses
Amazon

Debugging section consists of basic algorithm and data structures while analytical sections consists of analogy based questions.

5 Answers

Based on One's ability wrote on paper and tried to answer everything possible

I just gave the test and got 5 correct out of 7 and did well on the reasoning ability...are there any chances of me getting an interview call? Less

Yes Def, you have a good chance.

Show More Responses
Amazon

1. How do you pass something by reference in Python? 2. Write code to find the time between two dates? 3. Implement a tree and depth first search on that tree

4 Answers

Can you provide the 3rd answer please?

function dfs (node, target) { if(node === null) { return false; } if (node.val === target) { return true; } return dfs(node.left, target) || dfs(node.right, target); } Less

Continuation of my above function (these are all in javascript). Here is a node class for the tree: function Node(val){ this.val = val; this.left = null; this.right = null; } // create a simple binary tree var root = new Node(10); root.left = new Node(6); root.right = new Node(5); root.left.left = new Node(4); root.left.right = new Node(7); // see if element is in tree console.log(dfs(root, 4)); // returns true console.log(dfs(root, 8)); // returns false Less

Show More Responses
Amazon

A big project for 4 teams each with 3 people to do.

4 Answers

Are you invited for hiring even?

were you invited for hiring even?

To Matthew, I don't know. After finishing the video interview I was invited to come to Seattle to attend Amazon's group interview. Maybe some terms on the paper were about 'hiring even' but I didn't read and no one told me about it. Less

Show More Responses
Microsoft

Given a string of format '2+3*2-1', calculate and return the result. No parenthesis in the input, just integers and + - * / operators. Operator precedence has to be considered. Linear time complexity and minimal data structure use is preferred.

4 Answers

I used a different approach by making use of a queue: - parse the string, and push in the operands and operators onto a queue - evaluate the queue My general approach was this: - read in lhs, operator and rhs - if operator is "+" or "-", enqueue lhs and operator > if string is empty, we are done parsing --> enqueue rhs > else, prepend rhs to the string (e.g. str = rhs + str), to be parsed further - else, the operator is "*" or "/" --> perform the operation on lhs and rhs, and prepend the result to the string Final step is evaluating the queue -- simply dequeue lhs, operator and rhs and evaluate. (*note: this was tricky to get right on paper, and I've made a few mistakes which I had to debug) // Given: a well-formatted string e.g. "2 + 2*3 - 1". Evaluate the expression. string getCurr(string& str); int eval(string str) { if (str.empty()) return -1; // operand / operator queue std::queue q; // construct it char buf[5]; while (!str.empty()) { string lhs = getCurr(str), oper = getCurr(str), rhs = getCurr(str); // evaluate directly if (oper == "*") { int res = atoi(lhs.c_str()) * atoi(rhs.c_str()); // restore the string str = itoa(res, buf, 10) + str; } // evaluate directly else if (oper == "/") { int res = atoi(lhs.c_str()) / atoi(rhs.c_str()); // restore the string str = itoa(res, buf, 10) + str; } else // "+" or "-" { q.push(lhs); q.push(oper); // finished parsing the expression if (str.empty()) q.push(rhs); else // restore the string str = rhs + str; } } // evaluate the queue int res, rhs; string oper; res = atoi(q.front().c_str()); q.pop(); while (!q.empty()) { oper = q.front(); q.pop(); rhs = atoi(q.front().c_str()); q.pop(); if (oper == "+") res += rhs; else // "-" res -= rhs; } return res; } string getCurr(string& str) { if (str.empty()) return ""; string curr(""); // operator if (str[0] == '-' || str[0] == '+' || str[0] == '*' || str[0] == '/') { curr += str[0]; str = str.substr(1); } else // a number { do { curr += str[0]; str = str.substr(1); } while (!str.empty() && str[0] >= '0' && str[0] <= '9'); } return curr; } Less

Use 2 stacks. one for operands and one for operators. Keep pushing in operator as long as the newly pushed opertor has higher precedence than the "top of stack " operator. if not, pop out 2 operands and calculate result and again push it on stack Less

I did 2 pass on input string.

Show More Responses
A9.com

1. Finding first non repeated character in an array 2. Linux command to list files containing specific string 3. Mysql query related to Group by Second phone interview 1. create a doubly linked list out of that tree where each node represents sum of all nodes in the same vertical line. 2. Implement search for a sorted rotated array.

4 Answers

public class Solution { /** *@param A : an integer rotated sorted array *@param target : an integer to be searched *return : an integer */ public int search(int[] A, int target) { // write your code here if(A == null || A.length == 0){ return -1; } int start = 0; int end = A.length - 1; int mid; while(start + 1 < end){ mid = start + (end - start) / 2; if(A[mid] == target){ return mid; } if(A[start] < A[mid]){ if(A[start] <= target && target <= A[mid]){ end = mid; }else{ start = mid; } }else{ if(A[mid] <= target && target <= A[end]){ start = mid; }else{ end = mid; } } } if(A[start] == target){ return start; }else if(A[end] == target){ return end; }else{ return -1; } } } Less

1. Finding first non repeated character in an array class FirstNonRepeatedCharacter{ public static void main(String args[]){ Character[] input = {'a'}; if(input.length==1){ System.out.println(input[0]); } else if(input.length>1){ for(int i=0;i Less

1. Finding first non repeated character in an array class FirstNonRepeatedCharacter{ public static void main(String args[]){ Character[] input = {'a','b','c','b','a'}; if(input.length==1){ System.out.println(input[0]); } else if(input.length>1){ Set unique = new LinkedHashSet(); Set duplicates = new LinkedHashSet(); for(int i=0;i Less

Show More Responses
Viewing 1 - 10 of 1,120 interview questions

See Interview Questions for Similar Jobs