Grokking the Google Forward Deployed Engineer Interview
0% completed
Prefix Sums and 2D Dynamic Programming
Given an n by n grid and a list of squares placed on it, return the largest number of squares that cover any single cell. The candidate report from How Google Runs the Coding Round names this question as the harder follow-up: "maximum number of squares overlapping at a single point," in the style of LeetCode 2536. The same report says the interviewer asked the candidate to change approach midway.
The report does not say which two approaches were involved
.....
.....
.....
Like the course? Get enrolled and start learning!
Reading Progress
0%