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. ...

This Lyft interview question has 3 community responses on LeakCode. Unlock Premium to read full candidate answers and discussion.

LeetCode Question · Apr 2019

Lyft level 5 SDE Phone screen

SWE Phone Screen Senior

2 upvotes 3,094 views 3 replies

Question Details

Minimum path in mxn matrix from top left to bottom right. Next was find duplicates in an array where every element is 1 <= element <= n multiple duplicates; not just one. ...

Full Details

🔒

Unlock all Lyft questions

Full insider details, leaked discussions, and candidate experiences.

or every company, $100/year →

About This Question

This is a reported interview question from a lyft interview for a swe role (senior level) during the phone screen round reported in 2019.

It covers the following topics: Arrays, Matrix .

Topics

Arrays Matrix

Lyft level 5 SDE Phone screen

Question Details

Full Details

About This Question

Topics

More Lyft Interview Questions