Online test:
1. Easy leetcode
2. Print the kth smallest number in the array (optimize the native solution) - target nlogk solution -

1st Interview:
1. LRU Cache
2. Discussion about the last experience.
3. Followed by CS fundamentals.

2nd interview:
1. Easy leetcode
2. You have a list of company employees with their {name, team name}, get the maximum possible number of pairs as long as you cannot put 2 employees with the same team together.
3. Followed by CS fundamentals

Question

Online test:
1. Easy leetcode 
2. Print the kth smallest number in the array (optimize the native solution) - target nlogk solution -

1st Interview:
1. LRU Cache
2. Discussion about the last experience.
3. Followed by CS fundamentals.

2nd interview:
1. Easy leetcode
2. You have a list of company employees with their {name, team name}, get the maximum possible number of pairs as long as you cannot put 2 employees with the same team together.
3. Followed by CS fundamentals

Shopee

Shopee interview question

Want the inside scoop on your own company?

Bowls

Followed companies

Job searches