LeetCode Experience

#1642 Furthest Building You Can Reach

Interview Experience

LeetCode #1642: Furthest Building You Can Reach. Difficulty: Medium. Topics: Array, Greedy, Heap (Priority Queue). Asked at Amazon 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

Heap (Priority Queue) Arrays Greedy Heap Queue