LeetCode Experience

#3419 Minimize the Maximum Edge Weight of Graph

SWE coding Medium

Interview Experience

LeetCode #3419: Minimize the Maximum Edge Weight of Graph. Difficulty: Medium. Topics: Binary Search, Depth-First Search, Breadth-First Search, Graph Theory, Shortest Path. 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 Shortest Path Binary Search 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 Graph,Binary Search,Dfs,Bfs,Shortest Path Questions →