There were two phone interviews, and both focused on technical questions.

1. Compute the height of a given binary tree.

2. Discuss the difference between struct and class, and the usage of const.

3. Given a sequence of strings (e.g., A, B, C, D, A), where A = "abcde", B = "hello world", C = "NBA", D = "CNN", A = "abcde", remove duplicate strings. The output should be like A, B, C, D.

4. Given two integer arrays, both in increasing order, compute their intersection. For example, input: A = {1, 2, 3, 4} and B = {2, 3, 4, 5}, output: (2, 3, 4).

Given a sequence of strings, like A, B, C, D, A, in which A = "abcde", B = "hello world", C = "NBA", D = "CNN", A = "abcde", to remove duplicates of strings. The output is like A, B, C, D.