Phone Screen @Box

Position: Software Engineer, Full Stack/Developer Experience

  1. Introduce what they are working on
  2. Technical Questions
    1. Merge two sorted array: just describe the algorithm and time complexity
    2. Merge K sorted array: write the code.
    3. Two Sum: an sorted array, find if there is at least a pair of two elements which the sum equals 0. Just describe the algorithm and time complexity.
      I gave him two approaches: using HashMap and two pointers.
      Then he asked me to write the code with two pointers.
    4. Three Sum: just describe the algorithm and time complexity.

Leave a Reply

Your email address will not be published. Required fields are marked *