LeetCode Question

#64 Minimum Path Sum

Question Details

LeetCode #64: Minimum Path Sum. Difficulty: Medium. Topics: Array, Dynamic Programming, Matrix. Asked at SpaceX in the last 6 months.

Original Source

This is a frequency-tagged signal. The full problem statement lives on the original source.

View original →

About This Question

This is a reported interview question from a spacex interview for a swe role during the coding round.

It covers the following topics: Arrays, Dynamic Programming, Matrix .

Difficulty rating: Medium

More Spacex Interview Questions