LeetCode
Question
#2858 Minimum Edge Reversals So Every Node Is Reachable
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 Cashfree in the last 6 months.
Original Source
This is a frequency-tagged signal. The full problem statement lives on the original source.
View original →About This Question
This is a reported interview question from a cashfree interview for a swe role during the coding round.
It covers the following topics: Breadth-First Search, Depth-First Search, Graph Theory, Dynamic Programming, Graph .
Difficulty rating: Hard