2nd Round (1 hour) Programming related question on java and c/c++ Each section has 8 questions (2 programming and 6 multiple choice) 3rd Round - Phone Interview
Engineer Interview Questions
898,759 engineer interview questions shared by candidates
Describe a function to check if an integer is a power of 2.
Using Collabedit, write a program to find the index of the first non-repeated character in a java string.
Suppose you have a matrix of numbers. How can you easily compute the sum of any rectangle (i.e. a range [row_start, row_end, col_start, col_end]) of those numbers? How would you code this?
Find Kth smallest element in a BST.
Generate a new array from an array of numbers. Start from the beginning. Put the number of some number first, and then that number. For example, from array 1, 1, 2, 3, 3, 1 You should get 2, 1, 1, 2, 2, 3, 1, 1 Write a program to solve this problem.
Write a function that takes 2 arguments: a binary tree and an integer n, it should return the n-th element in the inorder traversal of the binary tree.
Nothing unexpected, I solved all the problems but I think I was too slow on the first one, which goes like: Given an array of numbers, they are arranged so that the a[0] is in the 1st bucket, a[1]a[2] are in the 2nd bucket, a[3]a[4]a[5] is in the 3rd bucket and so on. The question is then: given a number, you need to return if it is in any bucket or not.
Given a list of 4 billion integers, find an integer not in the list using 4MB of memory.
Given a string with parenthesis like "()()(()(()()", check to see if there are matching pairs. If there are matching pairs, return true, else return false. For example, ()()() returns true, ()()()) returns false.
Viewing 451 - 460 interview questions