Furthest Building You Can Reach variation
Filed under MindTickle
The question
Solve a DSA problem involving greedy algorithms and priority queues similar to finding the furthest building you can reach, followed by implementing a min heap from scratch.
No write-up yet. Related questions below have one.
Related MindTickle questions
Collected from public candidate posts and coding forums. Updated Nov 2026.