New
ML System Design & SQL tracks just landed
See what's new
×
Question Bank
Pricing
Blog
Forum
HOT
JobRadar
NEW
Referral
Description
Solution
Discussion
Submissions
Ask AI
Question Bank
LinkedIn
Coding Question
AI Insights
Quick Summary
Find a path from node 1 to node n using at most k edges.
Minimize the maximum edge weight (bottleneck) along the selected path.
Return the smallest achievable bottleneck value or -1 if unreachable.
What This Tests
Graph traversal and reachability under step constraints
Transforming optimization problems into decision problems
Exploiting monotonic properties for efficient searching
Algorithmic complexity analysis and trade-off evaluation
Common Patterns
Binary Search on Answer
Graph Traversal
BFS
Decision Problem Transformation
Collapse
Hint 1
Hint 2
Hint 3
What Interviewers May Ask Next
Ask AI Assistant
Ask AI Assistant
Ask me anything about this coding question!
Qwen
Qwen3.6-Flash
0/2000
Auto
Debug
Run
Submit
Test Cases
Input
Output
Expected
