Total interview time: 60 minutes, 2 Algo+DSA problem and then finished with 2 behavioral question.

Questions:

1. Find min value from a rotated sorted array (e.g. 3,4,6,1,2) and find the solution in O(lg-N) time.
2. Find all longest words in a dictionary where the words matches a given set of letters. E.g. input = “ate”, Dict = {eat, tea, ate, eaten}, output = {eat, tea, ate}
3. Behavioral question
   1. If your manager does not access to confidential information but requested, how would you respond?
   2. If your colleague left for the day but didn’t finish the work completely, so what should you do?

Recruiter invited for Super day next, I'll share feedback when I finish that. Please suggest any tips for the Super Day round if you had experience. Thanks.

Update: Location: Dallas, USA.