Software development engineer interview questions shared by candidates
you have 9 marbles, all of them identical except one of them is slightly heavier than the rest. in order to determine which is the heaviest, you have a balancing scale, however you are only allowed to use it twice. how do you determine the heaviest marble?
Dive them to three groups that each group consists three marbles. Balance the first two groups. If they are equal than the heavier marble is in the third group otherwise you can understand the heavier marble is in the group which is heavier. Follow the same tactic for the remaining three marbles in the heavier group.
I'm really bad at those type of questions, but I found this one to be quite easy. (obviously I won't give away the answer)
The questions in the first round were fairly straightforward if you use data structures like trees and linked lists for your work regularly. If you're working in areas where you don't use those data structures regularly, you may find the problems challenging. The question I was asked was "Given a sorted linked list, create a binary tree with the array with minimum height." Note that the question specified only binary tree and not binary search tree.
See Interview Questions for Similar Jobs
- Software Engineer
- Software Developer
- Senior Software Engineer
- Software Development Engineer II
- Software Development Engineer I
- Senior Software Developer
- Senior Software Development Engineer
- Java Developer
- Software Engineer III
- Software Engineer I
- Program Manager