LeetCode Question · Nov 2019 · USA

Google | Phone Interview | Smallest of maximums for all paths in matrix

SWE Phone Screen New Grad

3 upvotes 1,881 views 7 replies

Question Details

I was given this problem for a Google new grad phone screen a while back. I was able to provide a brute force solution that was definitely not the best...

Full Details

🔒

Unlock full leaked content

Full insider details, leaked discussions, and candidate experiences.

Get Premium →

Topics

Dynamic Programming Matrix Recursion

More from Google

Reddit Why did you create those day in a life video? Reddit It works Reddit Brave Software director screening went south fast, these companies are weird Reddit Job finished Reddit Anxiety and brain freeze during interview

← All Google questions Google Software Engineer Questions → All Dynamic Programming Questions →