终于绿了！NSC,超老的485（RD 03/01,RFE 08/16,Response 11/01,Approval 11/26)# Immigration - 落地生根
w*v
1 楼
感想：
0。题不难，都做出并跑出了。
1。全是从印度本土来的老印，除了recruiter
2。有点不专业，最后的面试是通过skype／hangout进行。面试官造成其中两轮时间缩
短。
3。面试时间11:00-6:00之间，不为申请人着想
4。没有onsite，是省钱吗？但据说工资开得高
网上测试题忘了，但记得是challenge III，在hackerrank上。3小时，实际不用那么多。
电面
Given a list of pairs in form of (employee, manager), find out all reports
of any given employee and print them out.
Example:
(A,B)
(C,B)
(D,A)
(B,E)
Given B, you should print out
B
-A
--D
-C
正式面试coding三轮
Given a string and an expression, find out how many times the expression
appears in the string as a sub sequence.
Example:
S=aaaacbbdcccc E=a+b+c- where + denoting the preceeding substring repeating
2 times while = denoting the preceeding substring repeating 4 times.
You should return 3 since it could be aa...bb.cccc or .aa..bb.cccc or ..aa.
bb.cccc
Given a stream of incoming integers whose length is unknown. Each incoming
integer will be called by accept(n). Implement rank(n) and accept(n) so that
rank(n) returns the number of received integers smaller than n.
Example:
accept(1)
accept(3)
accept(-1)
accept(1)
rank(2) should return 3 (1,1,-1 smaller than 2)
Given integer n, output all possible ways to nest if-endif pairs.
Example:
n = 3
You are expected to output
if
endif
if
endif
if
--if
--endif
endif
最后一轮招人主管电话面谈
0。题不难，都做出并跑出了。
1。全是从印度本土来的老印，除了recruiter
2。有点不专业，最后的面试是通过skype／hangout进行。面试官造成其中两轮时间缩
短。
3。面试时间11:00-6:00之间，不为申请人着想
4。没有onsite，是省钱吗？但据说工资开得高
网上测试题忘了，但记得是challenge III，在hackerrank上。3小时，实际不用那么多。
电面
Given a list of pairs in form of (employee, manager), find out all reports
of any given employee and print them out.
Example:
(A,B)
(C,B)
(D,A)
(B,E)
Given B, you should print out
B
-A
--D
-C
正式面试coding三轮
Given a string and an expression, find out how many times the expression
appears in the string as a sub sequence.
Example:
S=aaaacbbdcccc E=a+b+c- where + denoting the preceeding substring repeating
2 times while = denoting the preceeding substring repeating 4 times.
You should return 3 since it could be aa...bb.cccc or .aa..bb.cccc or ..aa.
bb.cccc
Given a stream of incoming integers whose length is unknown. Each incoming
integer will be called by accept(n). Implement rank(n) and accept(n) so that
rank(n) returns the number of received integers smaller than n.
Example:
accept(1)
accept(3)
accept(-1)
accept(1)
rank(2) should return 3 (1,1,-1 smaller than 2)
Given integer n, output all possible ways to nest if-endif pairs.
Example:
n = 3
You are expected to output
if
endif
if
endif
if
--if
--endif
endif
最后一轮招人主管电话面谈
