Consisted of 3 interviews and two coding rounds.

Round 1:

Question 1: Write a program to find the maximum difference between two elements of an array such that the greater number always has the greater index.

Question 2: For two strings A and B, we define the similarity of the strings to be the length of the longest prefix common to both strings. For example, the similarity of strings "abc" and "abd" is 2, while the similarity of strings "aaa" and "aaab" is 3.

Calculate the sum of similarities of a string S with each of its suffixes.

Sample Input:

2 ababaa aa

Sample Output:

11 3

Explanation: For the first case, the suffixes of the string are "ababaa", "babaa", "abaa", "baa", "aa", and "a". The similarities of these strings with the string "ababaa" are 6, 0, 3, 0, 1, and 1 respectively. Thus, the answer is 6 + 0 + 3 + 0 + 1 + 1 = 11.

For the second case, the answer is 2 + 1 = 3.

Round 2:

Question: Create a simple JSON-formatted data without using any JSON libraries.

Round 2 Question