Whiteboard programming: given a tile and a word, write a routine to determine if the word is valid. Wild card "*" might be present in tile and can be used for once when there is no match. For example, "bed" is valid given tile "abcdefg". "bread" is valid given tile "abcdefg*".
Software Development Engineer Interview Questions
32,823 software development engineer interview questions shared by candidates
A rotated sorted array (e.g. 34512), find the rotation count (in this case, 3 means rotated by 3).
You have an array of length n consisting of the integers from 0 through n-1 exactly once each, except for one which is missing. Find the missing number. The numbers can be in any order.
given an unsigned char array, find if there is a subarray whose elements sum up to a given value
Most of the technical questions, I felt very prepared for. The most difficult questions were behavioral. In particular, "Tell me about an experience where a project partner enjoyed working with you." Rather than talking about your skills you have to talk about how you worked well with others in a way that they enjoyed working with you, and do so without coming off as being arrogant. Also, they didn't ask the question directly, but came to it in a way that put you on the back foot. The question immediately before was to tell them about a time that you had difficulty working with a partner, and also about a time that a partner had difficulty working with you.
How many lines of code have you written in your favorite project?
Find the middle point of a linked list in best possible way
How to come out of a maze given that you can move one step at a time and you cannot turn left.
you have 100 doors in a row that are all initially closed. you make 100 passes by the doors starting with the first door every time. the first time through you visit every door and toggle the door (if the door is closed, you open it, if its open, you close it). the second time you only visit every 2nd door (door #2, #4, #6). the third time, every 3rd door (door #3, #6, #9), etc, until you only visit the 100th door.
Find the next node in a binary tree from any node (implying successor to a node)
Viewing 441 - 450 interview questions