Gave onsite interviews in Goldman-Sacchs Bangalore office after coding round + 3 phone interviews.

Coding round was fairly easy with 1 easy, 1 medium problem.

Phone interview - 1 (coderpad round)

1. a very easy ad-hoc problem
2. https://leetcode.com/problems/fraction-to-recurring-decimal/

Phone interview - 2

1. Longest leaf to leaf path in a tree. (solved by dp on trees)
2. check if a linked list is palindromic where each node stores a character
   (very optimised solution was needed)
3. find pair with sum 'x' in a rotated sorted array (solved by 2-pointer)

Phone interview -3

1. What is virtual inheritance in C++?
2. How is mongo internally implemented?
3. Difference between JSON , BSON
4. What is TDD?

ONSITE:
(1st onsite interview)

1. https://leetcode.com/problems/rotate-array/
2. https://www.geeksforgeeks.org/reverse-a-list-in-groups-of-given-size/

(2nd onsite interview)
3. https://www.geeksforgeeks.org/given-a-binary-tree-print-all-root-to-leaf-paths/

4. https://www.geeksforgeeks.org/zigzag-tree-traversal/
5. https://leetcode.com/problems/longest-palindromic-subsequence/

I was rejected as I was not able to solve last problem in time.