Amazon new OA1

没onsite通知. 估计挂了吧。

说不定过几天就有了吧，加油！

Here is the possible solution :

1. Use a HashSet<String> courseSet and store all the courses made by the user
2. Keep one more HashMap<Course, Integer> recommendation
2. Get the list of Friends for the user
3. Iterate through the friends list and in that find the courses selected by the friend
4. If the course present in courseSet, omit else, put it in recommendation and increment it's count by 1.
5. After all the friends are evaluated. Sort the recommendation by it's value,  

it's O(n) Space  because n is the number of courses selected in total by all your friends.
  it would be O(k*p) where k is the number of friends and p is the number of courses a friend selects

The only thing  confuse me is   
do we  need get  all the friends' friends  and add to friends list,  It will depend on  giving  function " getFirendsListForuser"

祝楼主好运

请问楼主是new grad找全职么？  还是说楼主以及有几年经验了呢？

楼主海投的？ 啥时候投的呀？祝楼主通过！

你这应该是HackerRange的题吧，和他们说的OA不是一类。我也是刚面了这个，题目好类似。