Status: SDE1 working in a startup in India, in Noida to be precise
YOE : 2 years
Position: SDE2 at Goldman Sachs
Location: Singapore
Date: March, 2020

I applied in the month of Feb, 2020 and I got a call around in first of week of March. One coderpad is scheduled after one week of the call.

Round 1 (Coderpad)

This round was of 75 mins and it had two questions.

1. First non repeating character in the array - https://leetcode.com/problems/first-unique-character-in-a-string/
2. There are some students and you are given their marks in the form as shown below -
   [("Tom", 69), ("Jerry", 40), ("Johny", 90), ("Tom", 80)]
   You need to return the student which has the highest average.

I did well in this round.

Round 2 (Coderpad)

This round was of 60 mins and it has only one question.

1. Sort segments to form continous path - You are given a set of points, you need to sort/rearrange them to create continous path. I couldn't find the exact question on leetcode. But below question is somewhat matches to that. https://www.***.org/find-simple-closed-path-for-a-given-set-of-points/

Input: points[] = {(0, 3), (1, 1), (2, 2), (4, 4),
                   (0, 0), (1, 2), (3, 1}, {3, 3}};

Output: {(0, 0), (3, 1), (1, 1), (2, 2), (3, 3),
        (4, 4), (1, 2), (0, 3)}

I didn't do well in this round. I was informed that there would be only one question in this round. So I kept going through dynamic programming questions and some Hard LC questions and boom suddenly I got a geometric question. That was a real funny situation for me because I was working really hard from past 10 days and suddenly I got this. I'm really bad at geometrics.
Nevertheless, I'm really thankful to LC community. It is teaching me a lot.