Application Process: Filled via Engineering Campus Hiring Program.
Topics Covered:
Tips:
Duration: 2 hours
Problems:
Note: Solved both within an hour due to prior practice.
Process: Filled the form and submitted resume. Attended webinar: Life @ Google.
Duration: 60 minutes
Problems:
XOR Queries (similar to this problem)
Given a BST, print ancestors of a node that are co-prime with it.
Scenario: Infinite walls, floor
Goal: Minimize floor area to place n
cubes
Constraints:
Scenario: India wants to destroy n
Chinese cities in D
days
Mechanics:
Y
destroys cities with defense < Y
instantlyGoal: Find minimum missile power to destroy all cities in D
days
Data: n
points of 2 types:
C timestamp a
: Cost (decreases value)L timestamp a
: Latency (increases value)Goal: Find minimum time interval that gives maximum profit = value - cost