Gahiz_

Heap

Challenges: 7Medium: 4Hard: 3

This Heap set gathers 7 coding problems, with a mix of 4 medium, 3 hard. They show up in interviews at companies like Amazon, Careem, Google, HungerStation, Talabat, so you can master the pattern once and recognize it everywhere.

Heap coding problems

  • Meeting Room Scheduler

    Difficulty: MediumAsked by: Amazon, Careem, Google

  • Kth Largest Element in Array

    Difficulty: MediumAsked by: Careem

  • Merge K Sorted Arrays

    Difficulty: HardAsked by: HungerStation, Talabat

  • Minimum Spanning Tree (Prim's)

    Difficulty: HardAsked by: Nokia Egypt

  • Top K Frequent Elements

    Difficulty: MediumAsked by: Careem

  • Merge K Sorted Lists

    Difficulty: HardAsked by: Amazon, Google, Meta

  • Queue Load Balancer

    Difficulty: MediumAsked by: SWVL, Uber

Asked by

Ready to practice for real?

Work through Heap problems in the editor, run your code, and check your solution against real test cases.

Practice coding challenges, start free