The phone screen consists of an interviewer calling you, asking a random question they found on HackerRank or a similar site, and then you solve it. They do not guide you through or attempt to collaborate. Once they ask the question, the rest of the interview is dead air on their side until you say you're finished.

Skills emphasized by Wish include:

• Getting the right answer the first time (finding a subpar solution and iterating improvements on it is discouraged).
• Having encyclopedic knowledge of the Java SDK, including method names for common structures (the online interface does not have good autocomplete, and you will be penalized for not knowing the name of the function you want to use).
• Proper Googling skills (they are less interested in having a solution that works than having the same solution the interviewer found on Google when they were preparing their interview question).

Given a 2D boolean array arranged to represent a map, where T is land and F is water, count the number of islands (conjoined patches of land completely surrounded by water) in the map.

Given an unsorted array of arbitrary integers, define a sequence as numerically-consecutive numbers (e.g. 1 2 3 4 5 is a sequence). Find the length of the longest sequence in the array. Note that the numerically consecutive sequences need not be consecutive in the array (e.g. 3 4 2 5 1 is a sequence of length 5). Perform this task in O(n) time.