lyft level 5 SDE Phone screen
Anonymous User
3128

Minimum path in mxn matrix from top left to bottom right.

https://leetcode.com/problems/minimum-path-sum/

Next was find duplicates in an array where every element is 1 <= element <= n
multiple duplicates; not just one.

Comments (3)