LeetCode Experience

#1631 Path With Minimum Effort

SWE coding Medium

Interview Experience

LeetCode #1631: Path With Minimum Effort. Difficulty: Medium. Topics: Array, Binary Search, Depth-First Search, Breadth-First Search, Union-Find, Heap (Priority Queue), Matrix. Asked at Meta in the last 6 months.

Original Source

This is a frequency-tagged signal. The full problem statement lives on the original source.

View original →

Topics

Breadth-First Search Depth-First Search Heap (Priority Queue) Union-Find Arrays Binary Search Graph Heap Matrix Queue Union Find

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

← All Meta questions Meta Software Engineer Questions → All Arrays, Binary Search, Dfs, Bfs, Union Find, Heap, Matrix Questions →