LeetCode
Question
·
May 2020
·
Los Angeles
Facebook | Phone | Transitive reduction & Factorial Trailing Zeroes
6 upvotes
2,128 views
14 replies
Question Details
Question 1: Given a directed graph remove return minimum of edges to keep all paths . Example: Input: [[1, 2], [1, 3], [1, 4], [2, 3], [2, 4], [3, 4]] Output: 3 Explanation: Minimum...
Full Details
🔒
Unlock full leaked content
Full insider details, leaked discussions, and candidate experiences.
Get Premium →Topics
Graph
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