LeetCode
Experience
·
Jan 2022
·
Los Angeles
Google Interview question 2022 | phone, onsite | graph, DP
33 upvotes
13,866 views
18 replies
Interview Experience
Telphonic round: Given a 2d matrix with value 0 and -1. mat[i][j] == -1 is boundary pixel. Calculate the minimum distance of each node mat[i][j] from nearest boundary pixel. e.g:- 0 0 0...
Full Details
🔒
Unlock full leaked content
Full insider details, leaked discussions, and candidate experiences.
Get Premium →Topics
Dynamic Programming
Graph
Linked List
Matrix