I submitted the following Python 3 code for this HackerRank challenge. Given an n × n grid with an
m in the center and a
p in one corner, it prints the directions to move the
m to the
I wanted to know how improve it or other observations.
#!/usr/bin/python def displayPathtoPrincess(n,grid): #first, find where p is located flag = True n = n-1 while(flag): if grid[n] == 'p': flag = False a = 0 b = n if grid[n] == 'p': flag = False a = n b = 0 if grid == 'p': flag = False a = 0 b = 0 if grid[n][n] == 'p': flag = False a = n b = n #else: #print("Something broke?") #Why does this execute? y = a - int(n/2) x = b - int(n/2) while 0 != y: if y < 0: y = y+1 print("UP") if y > 0: y = y-1 print("DOWN") while 0 != x: if x <0: x = x+1 print("LEFT") if x >0: x = x-1 print("RIGHT") m = int(input()) grid =  for i in range(0, m): grid.append(input().strip()) displayPathtoPrincess(m,grid)