半个小时不到的电话聊天，自我介绍+ why wish, 剩下时间确定选组意向。
之后立马发了OA（hackerrank 两道题）
题目详情
-
given a String (contains ‘a’ - ‘z’, ‘A’ - ‘Z’, ‘0’ - ‘9’), return the most frequent character. For example, given “abaac” with return ‘a’. If there is a tie, like “abcabc”, return the one that occurs first, which is ‘a’
-
given a list of integer called bad numbers, and an interval [l, r], a good segment is defined as a subinterval within [l,r] that doesn’t contain bad numbers. return the size of the longest good segment.