Status: 2 years previous IT experience in an investment bank. Officer in an Indian PSU.
Position: Analyst at Goldman Sachs
Location: Bangalore, India
Date: September 27th, 2021

Contacted by a recruiter on LinkedIn.

Online assessment: 2 questions, 120 mins
1. Variation of the number of ways to climb steps: but with 2,4 and 6
2. Remove characters in a string that occur continuously for a given length. Do this till no character can be removed further.

Coder pad round 1: 2 questions 60 mins f2f with analyst
1. Convert : aaabbccc → a3b2c3
2. Given a 2d grid with each cell having some value, find the largest value we can accumulate starting from the bottom left and ending at the top right. We can only move up or right.

Coder pad round 2: 2 questions 60 mins f2f with analyst
1. Binary tree zigzag traversal (https://leetcode.com/explore/interview/card/top-interview-questions-medium/108/trees-and-graphs/787/)
2. Given a stock price in n-days as an array: find the maximum profit we can make if we are allowed to hold only one stock on a given day. (https://leetcode.com/explore/featured/card/top-interview-questions-easy/92/array/564/)

Super day: Scheduled 3 rounds(2 Technical + 1 HM). Rejected after 1st round.
1. Variation of the longest increasing subsequence. (https://stackoverflow.com/questions/20392743/the-minimum-number-of-insertions-to-sort-an-array)
2. Given N stations on a circular route and a car with infinite fuel capacity and zero fuel on start.
We have access to two arrays of size N: available and required.
available[i] represents the fuel available at station i.
required[i] represents the fuel required to go to station i+1. (consider circular route. The last value in this array represents the fuel required to go to the first station.)
Calculate the index of the station from where we can start a round trip without fuel issues.
3. Implementation of LRU cache with O(1) access and how would you handle cache miss.