Status: 4.5 YOE
Position: MTS2
Location: Bengaluru
Date: December 2020

Hackerank Round:
A question which requires the knowledge of rest, and parsing json.
Round 1(DSA)
https://leetcode.com/problems/two-sum/
Lets say you have a horizontal line of 100cms : 0 - 100. Water droplets are falling on the line. Each droplet is 1 cm wide. Every time a droplet falls on the line, your program will get one coordinate. The code, should keep track of what portions of line is covered with water and return true if the whole line is covered otherwise false. The location that you get is the starting point of the droplet.

Round 2(LLD)
Its related to their own product. Not very difficult. Interviewer is trying to see if I can convert the requirements into classes , methods or not.
Round 3(HLD)
Google Drive Design. Features requested:
Features:

• Storing the objects
• We should be able to share the objects
• Live editing

Round 4(DSA)
Insert a node in sorted linked list
Print left view of a tree
Check if an array is min heap or not

Round 5(DSA)
Stream of events are coming. Each event has a value and timestamp <t, val>
We need to implement two methods
addEvent(Event e) : add every event in the data structure I used for storing
getMinimum() : give the minimum val till now.
The follow up question is how I change the code of getMinimum if we want it to return the minimum value in last one year.

Round 6(Cultural Fit Round)

Offer Details: https://leetcode.com/discuss/compensation/1704092/PaloAlto-Networks-or-Senior-Staff-Engineer-or-Gurgaon