1. Round 1 (DSA Problem – Classic Coin Change Variant)

• Given target N (people to cover) and sizes array, find the minimum number of coins needed to cover exactly N. If no exact combination exists, return -1.

• Examples:

  N = 5, sizes = [3,5] → 1

  N = 7, sizes = [3,5] → -1

2. Round 2 (LLD – BookMyShow)

• Design a simplified BookMyShow system.
• Entities: Movie, Theatre, Screen, Show, Seat, Booking
• Handling concurrent seat selection
• Basic class diagram & responsibilities

3. Round 3 (HLD – Job Scheduler)

• High-level design for a Job Scheduler.
• Discussed Scheduler service and Distributed queue (Kafka/SQS)

Outcome : Didn’t make it, but great learning across DSA, LLD, and HLD.