We start at the
source square and want to reach the
target square. Each move, we can walk to a 4-directionally adjacent square in the grid that isn’t in the given list of
The grid size is 1 million by 1 million and the maximum number of blocked squares is 200.
True if and only if there is a path otherwise return
# Input blocked = [[0,1],[1,0]] source = [0,0] target = [0,2] # Output is False
Solution by your_name_here