LeetCode: 987. Vertical Order Traversal of a Binary Tree
(Hard but Medium)
Sep 4, 20221 min read6
Search for a command to run...
Series
Practices and solutions for typical algorithm problems
(Hard but Medium)
Solutions For each grid (i, j), do BFS twice for both Pacific and Atlantic flow: O(n^4) For each grid (i, j), do BFS twice, but this time, can stop on grids already visited: slightly better For each grid (i, j) on each coastline, do BFS and return t...
Rotting Oranges (Medium)
3 Easy, 2 Medium
1 Medium
3 Easy, 1 Medium