how to print the shortest path string given in the video as the homework?
Shortest path string
Impose some if else conditions. If x is positive, means you have to move towards east. So print E x number of times. If x is -ve then you would have to print W.
Similarly is y is +ve print N y number of times and so on…
I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.
On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.