1 Last week a friend asked me to help him prepare for a job-interview at FB.
2 Given a set of n jobs with [start time, end time, cost] find a subset so that no 2 jobs overlap and the cost is maximum ?
3 Given 2 very large numbers, each of which is so large it can only be represented as an array of integers, write a function to multiply them.
트위터 반응

@jrogue: Facebook interview questions(영어): 난이도 높음! http://t.co/u3eGGGtXDO