A series of interviews that lasted all afternoon. In each one, they asked you a little about yourself and then asked you a series of programming questions.

Although I overcame most of them with optimal complexities, the second interview became complicated.

The problem was neither well-defined nor well-explained. Everything was done except collaborating on it.

It reached a point where I started to program a solution, but the data structure I was using was changed to the "default" one that would have been accepted, without even giving me the option to use my method.

Calculate all possible viable parenthesis combinations (e.g., "()()" is viable but "()())(" is not), up to n=8 (n=pairs of parentheses).

Two nodes are incorrectly placed in a BST. Find and swap them.

Perform a JOIN between two lists such that equal pairs between lists are returned (example: [1,2,3] and [1,2,2] returns [1,1], [2,2] and [2,2]).

Then, do the same, but the lists are "streams" of numbers (they don't fit in memory and arrive one by one), and the dictionaries also don't fit in memory.

Produce JSON matching this specification:

Translation = { "translatedText": string } Return: Translation