LeetCode Experience

#1102 Path With Maximum Minimum Value

SWE coding Medium

Interview Experience

LeetCode #1102: Path With Maximum Minimum Value. Difficulty: Medium. Topics: Array, Binary Search, Depth-First Search, Breadth-First Search, Union-Find, Heap (Priority Queue), Matrix. Asked at Google 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 Heap (Priority Queue) Union-Find Arrays Binary Search Graph Heap Matrix Queue Union Find

More from Google

Reddit Why did you create those day in a life video? Reddit It works Reddit Brave Software director screening went south fast, these companies are weird Reddit Job finished Reddit Anxiety and brain freeze during interview

← All Google questions Google Software Engineer Questions → All Arrays,Binary Search,Graph,Heap,Matrix,Bfs,Dfs,Union Find Questions →