Software Development Engineer Interview Questions in Melbourne | Glassdoor

# Software Development Engineer Interview Questions in Melbourne

8

Software development engineer interview questions shared by candidates

## Top Interview Questions

Sort: RelevancePopular Date

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

Sep 9, 2015
 How would you implement a game like candy crush?Be the first to answer this question

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

Sep 26, 2016
 A algorithm problem with O(1) space.Be the first to answer this question

Apr 16, 2014
 I was not expecting the question to be as complicated as a game but it turn out that you would not be expected to complete the functionalities but just provide your logic flows.Be the first to answer this question

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

Feb 22, 2015
 - How to determine if a given string is a combination of words in the dictionary. The given string does not have space at all. - Very complex questions about big O and improve algorithms2 Answers1st question) It's quite unclear what defines "combination of words", ie headset is a complete combination, however pulliehanger (just made up) is not a complete combination. Solution 1) Assuming dictionary is a hashset, we can simply iterate through the length of the string and check if that string exists in hash set. If it does we can recursively check the remaining string. It's expensive to store hashset and the algorithm takes 2^n. Solution 2) We can use trie data structure so that storage complexity would be lowered. The rest would be the similar as above (we iterate through and check every possibility with trie) How do we eliminate 2^n algorithm? Well, it's fairly simple. We can do a n^2 algorithm by simply trying every possibility of words, regardless of them being overlapped. Then we store these words' indices in a order kept list (such as linked array list in java), so that we would have a list where it is sorted by the first index. Then we check whether 2 of these elements in this list do not overlap by simply looking at the first and the last element in a constant (1) time, assuming that the question is asking not complete combinations. If the question is asking about whether it's a complete combination, then we would keep the elements that start with index 0 separately and use a dynamic programming with the rest where we fill indexes fit into next index table and try to match with the index 0 elements, which would take m^2 time.its not n^2 to try all words

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

Feb 3, 2016
 Design a system that air traffic controllers could use to manage the takeoffs and landings of aircraft.Be the first to answer this question

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

Feb 3, 2016
 You receive a constant stream of numbers. You wish to maintain the median value at all times. How would you do this?1 AnswerThis can be done in O(n) time with an insertion sort. Even better, if can be done in O(log n) time with two heaps, a max heap and a min heap.

### Software Engineer - Java Developer at Intelematics Australia was asked...

Jun 24, 2018
 Technical and behavioral questions. Asked about current projects and previous projects Be the first to answer this question

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

Apr 28, 2015
 The interviewer asked a question about sorting cards. Given a complete set of cards, you should sort them without using extra space. 3 AnswersI solved the interview problem. Computing the index for each card and inserting and swapping them into correct position.Use linked list and solve it with Merge Sort.It's a simple quick sort...
18 of 8 Interview Questions