PYTHON 3.6

def find_land(map, r, c, dir): Given a map and location, as well as a direction to look (one of ["N","NE","E","SE","S","SW","W","NW"]), indicate how many spaces we must travel on the map to reach land. If we're on land, the answer is zero. If there's no land in that direction on this map, we return None.

find_land(map4,2,2,"S") 2

find_land(map4,4,1,"NE") None

find_land(map5,7,0,"N") 5

SEE PIC FOR REFERENCE FUNCTIONS

def show (map): mystr'' substrings[] max_len max ([len (str(j)) for i in map for j in i]) for i in map: i [' '"(int (max-len)-len(str(j)))+str(j) for j substrings.append( ".join(i)) in i] return " ".join(substrings) +'n' #map 1 is coming from above function def highest_point (map): max=0 row-0 column-0 for r in range(1en (map)): for c in range(1en (map[r])) if map[r][c]>max: max map[r][c] column-c if max 0: return None else: return (row, column) def on_map (map, r, c): if(r)s0 r=0 and and else return False def is_map (map): if(len (map)>0): ssetO for x in range(len(map)): s.add (len (map[x])) for y in map[x]: if (not isinstance(y, int)): return False elif(yc0): return False if(len (s) 1): return True else: return False else return False def show (map): mystr'' substrings[] max_len max ([len (str(j)) for i in map for j in i]) for i in map: i [' '"(int (max-len)-len(str(j)))+str(j) for j substrings.append( ".join(i)) in i] return " ".join(substrings) +'n' #map 1 is coming from above function def highest_point (map): max=0 row-0 column-0 for r in range(1en (map)): for c in range(1en (map[r])) if map[r][c]>max: max map[r][c] column-c if max 0: return None else: return (row, column) def on_map (map, r, c): if(r)s0 r=0 and and else return False def is_map (map): if(len (map)>0): ssetO for x in range(len(map)): s.add (len (map[x])) for y in map[x]: if (not isinstance(y, int)): return False elif(yc0): return False if(len (s) 1): return True else: return False else return False