LeetCode
Question
·
Oct 2020
Facebook | Phone
6 upvotes
3,050 views
9 replies
Question Details
Given a two dimension array, if there is a path that can from top left to bottom right (1 means obstacle), this one is not hard.(bfs) Follow up, what if the...
Full Details
🔒
Unlock full leaked content
Full insider details, leaked discussions, and candidate experiences.
Get Premium →Topics
Arrays
Graph
Queue
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