What is the minimum number of
unshaded boxes to be crossed for
covering the shortest path from 'A' to 'B'
(both exclusive) without retracing the
path and without diagonal movement?
Answers
Answered by
0
Answer:
Step-by-step explanation:
plz kindly show the required diagrm..i didn't undrstand the diagrm
qais
okey...lemme attach that
dream
kkk
qais
got thedaigram..?
dream
np
qais
i have drawn according to your question
dream
but its not there
Similar questions