LeetCode Question · Oct 2020

Facebook | Phone

SWE Hard
Sign in to bookmark Original →
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 all Meta questions

Full insider details, leaked discussions, and candidate experiences.

or every company, $100/year →

About This Question

This is a reported interview question from a meta interview for a swe role reported in 2020.

It covers the following topics: Arrays, Graph, Queue .

Difficulty rating: Hard

Topics

Arrays Graph Queue

More Meta Interview Questions

Reddit META MLS Full loop interview in 1 week. Reddit How to use AI in AI-Assisted Coding Round- META Reddit Meta reached out for the same role 8 months after rejecting due to headcount Reddit What is this unrealistic bar for these technical screens?? Is everybody cheating? Blind Employee STACK RANKING? Is this only at Meta?
← All Meta questions Meta Software Engineer Questions → All Graph Questions →