Easier questions 1) Two variations of a program exist, A and B. When run on machine 1, A runs twice as fast as B. When run on machine 2, A runs 10x as fast as B. How would you investigate this? -same datasets -same versions of OS and libraries -same hardware 2) Had to code a method that calculated the factorial, first simply, then a second one recursively.
Given a set of shapes in 2D space, and a coordinate pair, write a routine that returns true if any of the shapes overlap the coordinate pair.
Given a set of integers find if two elements sum to a given value.
reverse a sentence such that the ordering of words is reversed but the words aren't changed
Find the intersection of two integer lists
Get the two highest number in a binary search tree
I spent much time for answering a question. Q : In a grid, if points, which refer locations of people, are given, which point in the grid will be the best point to meet together that the sum of distances from each position to the point is shortest. Distance between two points p1 and p2 is |p1_x-p2_x| + |p1_y-p2_y|.
Given a maze, represented as a matrix, and the initial and final points write an algorithm to solve this.
Write a function to find intersection of 2 sorted arrays.
Try to figure out the top unique search queries from a database with 100 billion entries
Viewing 2231 - 2240 interview questions