I interviewed with more than 5 people including CTO. I only receive one technical question that could have demonstrate any technical skill. The question was extremely easy and the interviewer did not even ask for the optimal solution (the interviewer actually did not want me to explain the optimal solution). The question was "You have an array of numbers. Return the number of couple that have 23 as their sum."
The question gave me as input an array a that had a permutations of the first n natural numbers and a number k. You have a series of plants, at the beginning all the plants are not in bloom. At the ith iteration the plant at the location of the array that had the value i was going to bloom. If a plant bloomed it stayed bloomed forever. We define a group as the number of adjacent bloomed plants. Find the last iteration that had a group of size k. E.g. Given a = [ 1 3 2 4] plants: 0 0 0 0 1 0 0 0 (1 group of size 1) 1 0 1 0 (2 groups of size 1) 1 1 1 0 (1 group of size 3) 1 1 1 1 (1 group of size 4)
sentence similarity
Write a method that finds depth of a (non-balanced) binary tree.
Given two linked lists, return the intersection of the two lists: i.e. return a list containing only the elements that occur in both of the input lists.
Write a function to return the longest common prefix between two strings.
Get the kth largest number from two sorted arrays
You are given a linked list with each node containing one extra pointer. Extra pointer points to any random node in the list.. Create a copy of this list..
Display all the numbers from 0 to 1000000. All the digits of a displayed number should be different.
Reverse words in string. Some questions about distributed system.
Viewing 1921 - 1930 interview questions