CareerCup

Given a large file with sentences and query string, design a system (Class, data structs, functions, etc) and algorithm to return the smallest window (start and end offsets) in the input file where the query words (in any order) are seen in the text file. What is the time complexity?

Given a count and maxvalue, write a program to return count number of unique random integers between 0 and maxvalue.

Given a list of files. Return all the unique lines from all files.

Find the coordinates of the rectangle which is parallel to axis and has minimum area.

Suppose you have a stream of (timestamp, tag) events. You need to filter this stream (online), leaving only events with tags that haven't been already encountered in the last X seconds.

Given some email ids, and a similarity function which says whether two email ids are similar, determine all the sets of email ids that are similar to each other.

You have a string consisting of open and closed parentheses, but parentheses may be imbalanced.
Make the parentheses balanced and return the new string.

Design a system which takes in latitude and longitude and returns back closest 5 locations.

You are given a series of moves as a string, such as ">^V<^". You need to output a list with all the series of moves that represent a loop if they were made by a robot for example.

A loop is defined as a series of moves that lead to the same position, for example "><" or "^V".

In the case of "^>V<^" the output should be ["^>V<", "^>V<"], essentially the last move generates a new loop because it leads to a position that was visited before and that naturally can be followed up to the same position and describe a loop.

Design the classes for a Battleship Game. Write the attack function.

You have a bidimensional space of area N that contains a circle of area M that could be placed anywhere in this space. What is the optimal way of finding the circle, drawing lines, considering you have a function that can tell you if a line is intersecting the circle?

You have 10^9 user, 10^3 websites that users are subscribed to and 2000 servers. Some users will unsubscribe from certain websites. How would you architect this system to be scalable and performant?

Best Time To Sell Stock but with 1 restriction: after you sell your stock, you cannot buy stock on next day.

Design a locking mechanism for a distributed system .

How can you read from disc such that you optimize the latency of the data read/writes?

Given that you have a graph with an even number of points, how do you find two points that equally subdivide the graph?

Consider a setup where a program is continuously receiving floats as inputs (a stream of numbers). Write a method that at any given time returns a moving average. That is the average of the last K numbers received. If the method is called before the program has received K numbers, simply return the average of however many numbers have been received thus far.

Data structure which supports both map operations and array operations without time complexity penalty.

Given an active stream of sorted arrays, how would you merge them efficiently?

What is the fastest way to compute cube root?

Implement ReentrantLock using simple locks.

How would you go about testing a distributed system such as Gmail, before releasing it to the public. How would you simulate realistic server load?

Design a unique hash function for every tweet in Twitter which will be used as part of a service.

(x-1)! % x = -1 in efficient way.

Write a function that takes two integer-valued arrays A and Q and computes a minimum length subarray A[i:j] that sequentially covers Q. Assume all elements in Q are distinct.

Write an algorithm for a robot navigating a maze.

Write an algorithm to control an alarm clock.

How would you design a system to store the search history of your users?

How does Google know that you are who you say you are?

How would you design the search future in Google from frontend to backend?

Print a BST such that it looks like a tree (with new lines and indentation, the way we see it in algorithms books).

You have a chess board of size NxN. You have a horse at a given starting position. You also have a function that gives you all the positions that the horse can reach from it's current position.

Given an ending position, find the path to it that uses the minimum number of moves.

Given a Binary Tree (balanced or not) write a method that transforms the tree in a degenerate tree (basically a data structure like a sorted linked list where each node has the left child null) and returns the new root. This must be made in place, no external memory usage is allowed.