LeetCode Question

#2858 Minimum Edge Reversals So Every Node Is Reachable

SWE coding Hard

Question Details

LeetCode #2858: Minimum Edge Reversals So Every Node Is Reachable. Difficulty: Hard. Topics: Dynamic Programming, Depth-First Search, Breadth-First Search, Graph Theory. Asked at Uber 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 Graph Theory Dynamic Programming Graph

More from Uber

Reddit Left industry for 5 years, how fucked am I? Reddit Uber | System Design Round | L5 Reddit Uber SWE-1 India Hiring – Cleared OA but Ended Up Waitlisted (Which Basically Means Rejected) Reddit Uber EM Interview Experience Reddit Uber Strategic Operations Interview

← All Uber questions Uber Software Engineer Questions → All Breadth First Search,Depth First Search,Dynamic Programming,Graph Questions →