Greedy

Challenges: 7Easy: 1Medium: 4Hard: 2

This Greedy set gathers 7 coding problems, with a mix of 1 easy, 4 medium, 2 hard. They show up in interviews at companies like Careem, Noon, Talabat, Instabug, Nokia Egypt, so you can master the pattern once and recognize it everywhere.

Greedy coding problems

  • Delivery Time Window Route

    Difficulty: HardAsked by: Careem, Noon, Talabat
  • Longest Palindrome Build

    Difficulty: EasyAsked by: Careem
  • Maximize Machines

    Difficulty: MediumAsked by: Instabug
  • Minimum Spanning Tree (Prim's)

    Difficulty: HardAsked by: Nokia Egypt
  • Queue Load Balancer

    Difficulty: MediumAsked by: SWVL, Uber
  • Token Bucket Refill

    Difficulty: MediumAsked by: Fawry, Google
  • Warehouse Slot Packing

    Difficulty: MediumAsked by: Amazon, Careem

Asked by

Ready to practice for real?

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

Practice coding challenges, start free