Write running code to print out the level order traversal of a binary tree
Software Interview Questions
550,976 software interview questions shared by candidates
Simple regex matching.
Phone interview questions: Given an array of numbers (1,2,3,8,0,2,2,0,10), move all 0s to the right end and all other numbers to the left while keeping relative order of non-zero numbers. Has to be linear in time and in-place.
Some questions on graph theory and then I was asked to write a function to check if a graph was bipartite.
How can one implement a queue with only a stack implementation?
Implement the functions for a stack and function getMinimum() all with O(1) complexity.
Java question was around String pattern searching which you can do easily in around 20 minutes, if you can keep your mind calm where that clock is also ticking.
Print a binary search tree. Each level on a new line.
During the phone interview, the coding question was done on a google doc and asked: In Java, given a String of [a-z] characters, find and return the first character that appears only once. I implemented it using a counting array and in the end the manager asked if I could implement it in another way, which I mentioned I could do it using a HashMap.
The two technical interviews towards the end were trying to find out if I had a particular skill set. I'm not sure what that is... The other interview with manager was broad and felt very comfortable.
Viewing 1281 - 1290 interview questions