BB 电面题目

Job Hunting Interview
, , , ,
1

Question 1:
LC 上的first-unique-character-in-a-string/

Question 2:
Print all possible routes from a start node to a destination node. For eg. start = C, end = D
A <----> B
A <----> C
A <----> D
B <----> C
B <----> D
Expected output:
C,A,B,D,
C,A,D,
C,B,A,D,
C,B,D,

2

第二个感觉是 All Paths From Source to Target， dfs应该就可以了吧