## Friday, August 31, 2012

### unique records

you are given 1 billion of records taking 1 petabyte of spaces. Some entries are reperated. How to find the unique records if you have just 8Gb of memory? How much space do you need for processing, what is the complexity?

## Thursday, August 30, 2012

### View from the top

You are given a million of segments in a 3d space. segments can have different colours. draw the segments you will see on the plane where z-axes is zero.

## Wednesday, August 29, 2012

### arrays

Given an array A and an integer m, find all the i, j such that A[i]+A[j] = m. Find all the i, j, k such that A[i]+A[j]+A[k] = m

## Tuesday, August 28, 2012

### find elements that appears [n/k] times in the stream

Given a stream of lenght n, and an integer k find all the elements appearing more than (n/k) times. what is the memory you need? how many times you need to process the stream? what about complexity?

## Monday, August 27, 2012

### cluster users by attributes

A massive social network decided to assign an unsigned int as unique id for each user. Also, each user has a set of attributes represented as string and integers. Define a suitable cluster strategy for users based on the common attributes.

## Sunday, August 26, 2012

### Intersect two sorted arrays

Given two arrays A and B, where #A = m and #B = n, how would you intersect A and B? Please discuss complexity and real optimization

## Saturday, August 25, 2012

### Sum maximum

Given an array of n positive integers. Write a program to find the sum of maximum sum subsequence of the given array such that the intgers in the subsequence are sorted in increasing order.

## Thursday, August 23, 2012

### Sequences in sorted order

Given two integers k and n, write a function that prints all the sequences of length k composed of numbers 1,2..n. You need to print these sequences in sorted orde

## Wednesday, August 22, 2012

### Find the minimum distance

Given an unsorted array arr[] and two numbers x and y, find the minimum distance between x and y in arr[]. The array might also contain duplicates. You may assume that both x and y are different and present in arr[]

## Sunday, August 19, 2012

### Bing and Windows 8

Apparently, I am in the video (someone told me ;))

## Saturday, August 18, 2012

### Autosuggest and Bing

My team is shipping this Autosuggest Backend

"“As you type results, Bing will offer suggestions and if we do say so, the auto-completion feels pretty quick.”"

## Friday, August 17, 2012

### Related Searches and Bing

My team is shipping this Related Searches ;) ;)

http://news.cnet.com/8301-10805_3-57495215-75/bing-windows-8-app-brings-tiled-goodness-to-your-search-results/

## Thursday, August 16, 2012

### Subset sum

Find subset of elements that are selected from a given set whose sum adds up to a given number K. The set contains non-negative values.

## Wednesday, August 15, 2012

### Special Stack

Design a Data Structure SpecialStack that supports all the stack operations like push(), pop(), isEmpty(), isFull() and an additional operation getMin() which should return minimum element from the SpecialStack

## Tuesday, August 14, 2012

### Count in an array

Write a function to count number of smaller elements on right of each element in an array.

## Monday, August 13, 2012

### Celebrity problem

In a party of N people, only one person is known to everyone. Such a person may be present in the party, if yes, (s)he doesn’t know anyone in the party. We can only ask questions like “does A know B? “. Find the stranger (celebrity) in minimum number of questions

## Saturday, August 11, 2012

### Longest Bitonic distance

Given an array arr[0 ... n-1] containing n positive integers, a subsequence of arr[] is called Bitonic if it is first increasing, then decreasing.

## Thursday, August 9, 2012

### Find a triplet that sum to a given value

Given an array of integers

## Saturday, August 4, 2012

### Intersection and Union

Given two Linked Lists, create union and intersection lists that contain union and intersection of the elements present in the given lists. Discuss complexity and make your assumptions.

## Friday, August 3, 2012

### Add two numbers without using arithmetic operators

Hint: use bit operators

## Thursday, August 2, 2012

“Facebook is a partner with Google’s biggest rival, Bing, to handle web searches.”

Facebook had previously allowed users to filter their Facebook searches by web results after clicking over to a main results page, but it hadn’t offered the option from the typeahead, which only included Facebook objects. Making it more efficient to search the web from Facebook’s search bar will give users an incentive to use Facebook search rather than going to a separate search engine like Google. “

## Wednesday, August 1, 2012

An hidden gem, not so well known: Academic Search Microsoft. Want it integrated in bing?