Microsoft

The interviewer asked me to find the median of two separate sorted integer arrays in overall O(log(min(m, n))) runtime; after discussing a two-pointer merge approach, I optimized it by performing binary search over the partition cuts of the smaller array. I was presented with an infinite stream of incoming URLs and asked to detect duplicates using minimal memory, where I proposed and analyzed a Bloom filter implementation, detailing false-positive probabilities and hash function trade-offs. The interviewer gave me a skyline silhouette problem where buildings are defined by triples [left, right, height] and asked to output the key contour points; I solved it by sweeping a vertical line across all start and end coordinates while maintaining active building heights inside a max-heap.