LeetCode
Question
·
Sep 2020
Facebook | Phone Screen | SDE
1 upvote
1,273 views
3 replies
Question Details
Given a matrix of size m x n, Find the longest path in the matrix from (0, 0) to (m, n). You can move in 4 directions, up, down, left right. Visit...
Full Details
🔒
Unlock full leaked content
Full insider details, leaked discussions, and candidate experiences.
Get Premium →Topics
Matrix
More from Meta
Reddit
Leetcode is cooked in 2026 and we don't hire people who only grind leetcode.
Reddit
Returning to SWE work after 3 years of cancer treatment
Reddit
2026 New Grad Recap
Reddit
Most likely failed meta phone screen
Reddit
Targeting OpenAI SWE Roles? Insights on what to expect from recent system design loops