Given an n x m integer matrix, find the shortest path from (0,0) to (n-1,m-1) such that the sum of values along the path is minimum, and the path is also lexicographically smallest among all the paths with minimum sum. You are allowed to move up, down, left, right. Print the path as a string of letters L (left), R (right), U (up), D (down).

1 <= n <= 1000, 1 <= m <= 1000

I presume this is a modification of Dijkstra but I do not know how to do it. Can anyone help?

Hi everyone!

We have recently built a Chrome Extension (screenshots below) that allows you to take notes on problem page.

Link to the extension

Some people maintain a CSV for this, but no need anymore.

Developers: Shubham Goel & Me

Some use-cases of the extension:

Features to be added:

• Export question name, link, rating, and note to CSV.
• View all notes on the profile page.

Screenshots:

Once you login to the extension, this will appear:

Add note window:

Please feel free to report any bugs or make suggestions. We are committed to improving the extension and will be happy to accommodate.