六年经验,现在是Senior Software Engineering
面的也是senior
店面一小时
- Different description, but same problem as coin change. Find all possible change for given amount of money with some denominations.
Onsite
第一轮: (1 小时)
- Intro
- 题目不记得了
第二轮: (1 小时)
- Remove duplicate from list of integers
- Follow up: read integers from file. File size is 10 times larger than RAM
- There are n users, indexed from 0 to n-1. Log file shows the time and two users that got connected. Find the earliest time that each user connected (directly or indirectly) to all others.
午饭 (1 小时)
- Lunch & tachnical conversation with manager.
第三轮: (1 小时)
- Design slack.
第四轮: (1小时)
- Behavioral & Technical questions.
- Given list of integers. All integers except one repeated more than once. Find the non-duplicate number.
第五轮: (1 小时)
- Java questions.
- Given int array and target sum. Print all pairs that their sum equals to target (coding on computer, all others are on whiteboard).
- Implement immutable class.