The first interview was easy. They asked how to go about finding correlations between n groups of viruses.

I used an nxn array.

They then asked what if memory was constrained, so I said hash map.

The second interview was a little harder, and you need to know recursion.

First, you were asked to do a method where you take in a number and print the first ten terms of a sequence which shows the number of numbers, such as 11, then you'd have 21, then 1211, then 111221, etc.

Then the last question was hardest; you had to say how to take one string and get another string using only letter flips, like bad to bda to dba to dab.

The last question was the hardest. You had to say how to take one string and get another string using only letter flips, like bad to bda, to dba, to dab.