谷歌上门

  1. Given an array, and a target, the question was whether the sum that can be returned in this array can be a target, followup is how many such subsets are returned, and if not only, can also be reduced, or multiply and divide Do, and if it is required to return to the subset itself, how to do
    Eg Given [3,5,6,7,3,2,6,1] t=9
    Return [5,3,1], [7,2] etc.

  2. Given a sorted circular linked list (one-way), and a random node in the list, there is also a target number, request to insert the list to ensure the order, duplicate if any, followup two of the numbers are anti- What to do
    eg 1->3-> 5-> 7-> 1, node=3, num=4
    Return 4->5->7->1->3->4

  3. Given a digital input stream, The average value of the last last k value is required, and in the calculation, it is required to remove top5% and bottom5% of the k numbers, interviewer wanted linear time .

  4. https://leetcode.com/problems/smallest-range-covering-elements-from-k-lists/