Project44

Round 1: DSA (Coin Change Variant) Problem: Given a target integer $N$ and an array of coin sizes, determine the minimum number of coins required to sum exactly to $N$. If no combination results in the exact target, return -1. Examples: * Input: $N = 5$, sizes = $[3, 5]$ | Output: $1$ * Input: $N = 7$, sizes = $[3, 5]$ | Output: $-1$ Round 2: LLD (Movie Ticketing System) Problem: Design a simplified version of a platform like BookMyShow. Solution: The design focused on defining core entities such as Movie, Theatre, Screen, Show, Seat, and Booking. Key implementation details included a class diagram defining specific responsibilities and a strategy for handling concurrency to prevent race conditions during seat selection. Round 3: HLD (Job Scheduler) Problem: Design the high-level architecture for a distributed Job Scheduler. Solution: The proposed architecture utilized a central Scheduler service integrated with a distributed queue (e.g., Kafka or SQS) to manage job ingestion and execution reliability. Outcome While the process did not result in an offer, it provided valuable experience across algorithmic problem solving and system design.