Microsoft

Given an integer array representing item weights and corresponding values, find the maximum total value that can fit into a knapsack of capacity W using 0/1 knapsack dynamic programming. Given a stream of incoming coordinate points, continuously return the k closest points to the origin using a max-heap of fixed size k. Serialize a binary tree into a single formatted string and deserialize that string back into the original binary tree structure.