+ 1

Given a N∗M matrix of numbers from 1 to N∗M(each  number occurs only once), find a path from top left to right bottom while movi

14th Nov 2017, 1:43 PM
Dewansh Shekhar
Dewansh Shekhar - avatar
6 odpowiedzi
+ 2
Given a N∗M matrix of numbers from 1 to N∗M(each  number occurs only once), find a path from top left to right bottom while moving right or down only. If we sort all values visited in this path it should be lexico-graphically smallest
14th Nov 2017, 1:51 PM
Dewansh Shekhar
Dewansh Shekhar - avatar
+ 12
Do your own homework!
14th Nov 2017, 1:57 PM
qwerty
qwerty - avatar
+ 10
question is incomplete
14th Nov 2017, 1:48 PM
jay
jay - avatar
+ 7
You can edit the question and add the question details you added as a comment to the description section. in the question area put something like Help; Find the shortest path or something like that. hint: use the 3 at the top right corner
14th Nov 2017, 2:17 PM
jay
jay - avatar
+ 1
oo sorry wait i m trying to post it again but just please Upvote my question
14th Nov 2017, 1:49 PM
Dewansh Shekhar
Dewansh Shekhar - avatar
+ 1
bro i m not able to answer it that's why i m asking you and yups i m not a programming student so it's not my homework i actually learns programming online. anyway thanks😊👍
14th Nov 2017, 2:01 PM
Dewansh Shekhar
Dewansh Shekhar - avatar