1. Given an array that contains duplicates (except for one value), find the one value that does not have a duplicate in that array. Explain the complexity of your algorithm. So in the array: A = [2, 3, 4, 5, 2, 3, 4] your algorithm should return 5 since that's the value that does not have a duplicate. 2. Explain the process that happens when you type your username and hit submit on a website (HTTP, server/client communication, etc...)
Last interviews question for which I got 10 mins was a tricky one. He wanted me to implement Google's "Did you mean" logic.
Given an array of pairs of numbers, simplify the numbers. The pairs represent ranges, and the result is a simplified version of these pairs. So [1,5],[3,7] should result in [1,7].
More of logical questions.
Write a function called eval, which takes a string and returns a boolean. This string is allowed 6 different characters: 0, 1, &, |, (, and ). Eval should evaluate the string as a boolean expression, where 0 is false, 1 is true, & is an and, and | is an or. An example string might look like "(0 | (1 | 0)) & (1 & ((1 | 0) & 0))"
Try-catch block, handle class, matrix indexing in MATLAB. Declaring private methods in Python. A lot of importance was given to behavioral questions.
general background questions.
Convert a binary tree to a doubly circular linked list.
First Question: Print all combinations from dictionary which will result in number N Input Dictionary { “flag”:4.5, “temp”:2 ,”foo”:9} N : 11 Output: “Flag”*2 + “temp”*1 “Foo”*1+”temp”*1 Second Question: Return list of root-to-leaf sum (in left to right) from given tree Input: 1 / \ 2 3 / \ 4 5 Output: [7,8,4]
Given a list of persons and a function knows(I,j) which returns true if person I knows person j, find a celebrity person defined as: person doesn't know anybody else and everybody else knows him.
Viewing 1431 - 1440 interview questions