LeetCode
Experience
·
Nov 2021
·
Los Angeles
Facebook| Phone Interview | NewGrad | Backtrack Find All Path
2 upvotes
640 views
6 replies
Interview Experience
It is a very basic question. Given a m*n matrix, start from (0,0) and end at (m-1, n-1). Output all the possible path using backtrack. I came up with a solution in...
Full Details
🔒
Unlock full leaked content
Full insider details, leaked discussions, and candidate experiences.
Get Premium →Topics
Backtracking
Binary Tree
Linked List
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