tags::
type:: Leetcode_Solution
in:: Algorithms MOC

Leetcode 417 - pacific atlantic water flow

• make two sets containing coords
• one of them will contain all tiles which can reach the pacific
• one of them will contain all tiles which can reach the atlantic
• use graph DFS traversal to find all tiles that are added to each set
• return the set intersection