My interview was with E-Clercx. They conducted the first round, and their client, Goldman Sachs, took my second round.

Both rounds were similar, requiring me to complete Java code.

In the first round, I had questions based on HashMaps. I had to insert and then print values.

There was also a question on TreeSets, which requires knowledge that it implements the Comparable interface.

Another question involved data type conversions, such as converting a String to an int.

Two Java questions were presented on CoderPad. I was asked to complete the code and pass their test cases.

First question: Given a String[][] array of names and scores. You have to find the best average score among the given students. For example, if the array has Ram:100, Shyam:90, Ram:70, the average score for Ram would be (100 + 70) / 2 = 85, and for Shyam, it would be 90 / 1 = 90. The function should return 90.

If the answer is not an integer, return the floor of the answer.

Second question: Given a string, return the starting index and the maximum count of a character appearing continuously. For example, "aabbbbcdAA101aaa" should return {2, 4}, since the character 'b' has the maximum continuous count.