Questions included: array where indexes correspond to the tree node number of a parent node, and values correspond to current tree node number., root having number -1 Write code to recreate a tree (binary tree, bnon-BST). Another question was: given an array of numbers including negative, print the highest sum of the continuous sequence you can find. Another one: difference between hashtable and hashmap, etc. Detailed performance test questions: load, stress, etc tests. Given than these definitions differ from company to company (I attest, as my parent heads performance engineering in large US defense company and this was discussed over and over)...why write down and question every detail from you response and pick on coefficients such as 1.5 versus 2, etc: this is quite nonsensical.
