Kinsa ganahan mudiscuss sa solution ani nga problem? :D

[nomnomnom]

---

Actually this the final problem I needed to answer way back when I was still applying for this certain company. Nakahinumdom ra ko ani nya lately of out the blue out of dumot siguro kay atong tyma wa man ko kaanswer haha, time limit was 30 mins.

I need to code this in Java, i know Java so algo or approach nalang jud kuwang.

TEH PROBLEM:

- naay 2D array of integers (any dimensions) maze ni siya
- values only 1 or 0
- if 1 kay wall, meaning d maigan (duh lol) if 0 kay pwede
- naay random initial point (x y coordinate)
- TO DO: return the least number of steps (1 step per move, moves kay up, down, left, right, NO diagonals) para makaguwas sa maze
- definition sa "nakaguwas" kay naa ka sa edge sa 2D array for example myArray(0, x) or myArray(x, 0) bsta either sa 4 sides sa 2d array

im thinking of backtracking, samot nag mabangga na sa wall, any thoughts guys? salamat

this is purely for fun, or for the sake na nakaanswer kintahay ko after ko nila gireject (yes wa ko nadawat haha wa gud kaanswer! XD)

[josephG]

google dijkstra and A* algo