โ† Drishti-Soft Solutions questions

Tees Mar Khan matrix house robbing

Filed under Drishti-Soft Solutions

The question

Given a matrix representing houses with values, start from the top-left corner and reach the bottom-right corner moving only right or down, finding the path that collects the maximum value under the constraint that if a house is robbed you cannot rob an adjacent right or down house, but you can rob diagonally located houses.

No write-up yet. Related questions below have one.

Related Drishti-Soft Solutions questions

Collected from public candidate posts and coding forums. Updated Nov 2026.