Round 1 - Zoom Call.

Two people were present.

The first person (she) sounded clear. The other person (he) didn't have any idea about the questions he was asking.

He didn't know what concurrency was, just throwing or trying to prove what he had solved. He was not listening and not even able to understand the technology terms (lol). I wouldn't even consider him a high school student, but he is a Principal Engineer at Oracle.

However, she sounded clear, asked two easy questions, and was able to answer them in less time.

Find if a linked list is a palindrome or not. I was able to solve it using an array (which functions similarly to a stack).

/**

• Q1. Write the code for the following pseudocode and explain how it works.
• Initialize:
• max_so_far = 0
• max_ending_here = 0 // initialized to zero
• Loop for each element of the array // integer array, iterating over the array, 0 < arr < 1000
• (a) max_ending_here = max_ending_here + a[i] // counting the array values on every iteration, e.g., 1, 2, 3, 4, -11 => 1, 3, 6, 10, -1
• (b) if (max_ending_here < 0) max_ending_here = 0 // e.g., -1 becomes 0
• (c) if (max_so_far < max_ending_here) max_so_far = max_ending_here // e.g., 1, 3, 6, 10 => 10
• return max_so_far */

Both are easy questions.