Software Development Engineer Internship Interview Questions | Glassdoor

# Software Development Engineer Internship Interview Questions

14

Software development engineer internship interview questions shared by candidates

## Top Interview Questions

Sort: RelevancePopular Date

### Software Development Engineer In Test/SD Summer Internship at Microsoft was asked...

May 17, 2012
 Given an array of positive and negative numbers, give an algorithm that would find the sequence of numbers that give the largest sum. The numbers have to be in sequential order. 2 AnswersThe naive algorithm will take O(n^2) time, but it is very easy to code. The divide and conquer algorithm will take O(nlgn) time, but a little challenge to implement.If by "sequential order" you mean that the indices of the numbers in the subsequence must be consecutive, I think this should work in O(n): int main() { int best[N], B, i, a[N]; //input to a; best[0] = a[0]; B = a[0]; for(i = 1; i best[i-1]) best[i] = B + a[i]; else best[i] = best[i-1]; B = max(a[i], B + a[i]); } return best[N-1]; return 0; }

### Software Development Engineer Internship Summer at Amazon was asked...

Mar 16, 2013
 How to convert a string to integer (expect to write a method for it) ? without using parseInt valueat stringtokenizer split (that what I suggested to use but they were all prohibited)1 Answer(a) write a method to convert a string digit to an int (lots of ways to do this) (b) int result = 0 (c) iterate through the string backwards, with the indexes starting from 0 - result += convert(current character) * 10^index ie "569" - 9 x 10^0 + 6 x 10^1 + 5 x 10^2 = 9 + 60 + 500 = 569

### Software Development Engineer Internship at Amazon was asked...

Apr 24, 2012
 Basic java questions and write a method to test whether a given binary search tree is valid or not1 AnswerTesting whether a binary tree is a binary search three: class BTNode(object): def __init__(self, value, left=None, right=None): self.value = value self.left = left self.right = right def BSTMin(node): return BSTMin(node.left) if node.left else node.value def BSTMax(node): return BSTMax(node.right) if node.right else node.value def isBST(node): if node.left and not (isBST(node.left) and BSTMax(node.left) < node.value): return False if node.right and not (isBST(node.right) and node.value <= BSTMin(node.right)): return False return True

### Internship Software Development Engineer In Test (SDET) at Microsoft was asked...

Mar 19, 2014
 Most unexpected was the last interview of the day. It seemed as though my interviewer had no plan at all for what to ask and just let questions develop so they took me off guard.Be the first to answer this question

### Software Development Engineer Internship at Amazon was asked...

Apr 29, 2011
 how do you design a cache. data structure focused.Be the first to answer this question

### Software Development Engineer Internship at Amazon was asked...

Apr 24, 2012
 I was given a scenario in which I was a restaurant manager and I had to create a software for managing reservations. I had to tell him the use cases and also which classes would I be using and I was told to code an example entity class. Be the first to answer this question

### Software Development Engineer Internship at Amazon was asked...

Apr 29, 2011
 what data structure needed to store a IP address?Be the first to answer this question

### Software Developer Engineer (Internship) at Amazon was asked...

Dec 12, 2013
 Write a function that determines the longest palindrome in a given string. Be the first to answer this question

### Software Development Engineer Internship at Microsoft was asked...

Mar 9, 2013
 Given a sorted array, find two elements that sum up to a certain value in linear time.Be the first to answer this question

### Software Development Engineer (Internship) at Microsoft was asked...

Jun 21, 2013
 How would you design a GPS device for a hikerBe the first to answer this question
110 of 14 Interview Questions

More