LeetCode
Experience
·
Sep 2021
Facebook Phone screen for E6
2 upvotes
1,439 views
3 replies
Interview Experience
Given a 2D matrix that has 2K ones. Find K paths that connect two 1\'s and you can move up, down, right or left. These paths should be non intersecting. 1000 0000 0001 Path...
Full Details
🔒
Unlock full leaked content
Full insider details, leaked discussions, and candidate experiences.
Get Premium →Topics
Arrays
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