First Round (Coderpad) (1 hr)

• Easy LC question based on HashMap
• Shortest path between stations (https://leetcode.com/discuss/interview-question/356874/goldman-sachs-phone-screen-2019-shortest-path)

Second Round (Zoom) (1 hr)

• Solved using stack with concept of Previous Lower Element
• N seats arranged in a line, whenever a new person comes, he/she should sit such that overall distance is maximum between any two sitting persons. Any person can leave or take the seat. complete two fns one for assigningSeat, one for RemovingSeat.
  Example: For 5 seats
  Initial arrangement: 0 0 0 0 0
  1st person enter: 1 0 0 0 0
  2nd person enter: 1 0 0 0 1
  3rd person enter: 1 0 1 0 1

Third Round (Zoom) (1 hr)

• Return any peak in an array of integers, peak is when a number is bigger than its neighbours.
• For a tree print left view, bottom view and right view elements.

Fourth Round (Zoom) (1 hr).

• You receive 7 billion ages one by one from a data stream, and at the end find median. (Hint: numbers given are age)
• Possible ways to optimize time taken by a query for SQL DB

Fifth Round (Zoom) (>1 hr)

• Project discussion, Java heap memory profiling and behavioral questions
• https://leetcode.com/problems/max-points-on-a-line/
• For a string we are given pair of indices that cab be swapped to obtain lexicographically smallest string https://leetcode.com/problems/smallest-string-with-swaps/
• Probability: Team1 has winning probability p and Team2 has winning probability of q. Maximum 3 sets of game can be played with them. Which has the higher probability: game getting finished in 2 sets or 3 sets.

Sixth Round (Zoom)(1 hour)

• Why GS?
• Project discussion
• Min depth of tree. (All possible ways were asked)
• Given array of integers, return number of ways to form a target number (say 100) by putting below operators in between consecutive integers: "+", "-", ".", here operator "." means concatenation of two numbers.