Booking conflict resolution in LLD - Cheat Sheet & Quick Revision

Recall & Review

beginner

What is booking conflict resolution in system design?

Booking conflict resolution is the process of managing overlapping or conflicting booking requests to ensure that no two bookings occupy the same resource at the same time.

intermediate

Name a common technique to prevent booking conflicts in real-time systems.

Using locks or transactions to ensure atomicity when checking and creating bookings prevents conflicts by making sure only one booking can be confirmed for a resource at a time.

intermediate

Why is optimistic concurrency control useful in booking systems?

Optimistic concurrency control allows multiple users to attempt bookings simultaneously and only checks for conflicts at commit time, improving performance while still preventing conflicts.

beginner

Explain the role of a booking calendar or timeline in conflict resolution.

A booking calendar or timeline visually represents booked and free time slots, helping the system quickly detect overlaps and prevent double bookings.

advanced

What is a deadlock and how can it affect booking conflict resolution?

A deadlock occurs when two or more processes wait indefinitely for each other to release locks, causing the booking system to freeze or fail to resolve conflicts properly.

Which method helps avoid booking conflicts by ensuring only one booking is processed at a time?

A Sharding

B Caching

C Load balancing

D Locking

Locking ensures that only one process can access the booking resource at a time, preventing conflicts.

What does optimistic concurrency control do in booking systems?

A Prevents all concurrent bookings

B Allows concurrent attempts and checks conflicts at commit

C Locks the entire booking calendar

D Queues all booking requests

Optimistic concurrency control lets multiple users try bookings simultaneously and checks for conflicts only when saving.

What is a common symptom of deadlock in booking conflict resolution?

A System freezes or stalls

B More available slots

C Faster booking confirmations

D Automatic conflict resolution

Deadlocks cause the system to freeze because processes wait forever for each other to release locks.

Which data structure helps visualize and detect booking conflicts easily?

A Calendar or timeline

B Queue

C Stack

D Hash map

Calendars or timelines show booked and free slots, making conflict detection straightforward.

What is the main goal of booking conflict resolution?

A Allow double bookings for popular slots

B Maximize number of bookings regardless of overlap

C Prevent overlapping bookings on the same resource

D Ignore conflicts and notify users later

The goal is to prevent overlapping bookings so that resources are not double-booked.

Describe how locking mechanisms help resolve booking conflicts.

Think about how only one person can book a seat at a time.

Explain the difference between optimistic and pessimistic concurrency control in booking systems.

One trusts users to not conflict, the other blocks access upfront.

Practice

1. What is the primary goal of booking conflict resolution in a system?

easy

A. To ignore booking times and accept all requests

B. To allow multiple bookings at the same time for efficiency

C. To delete all previous bookings automatically

D. To prevent overlapping reservations for the same resource

Solution

1. Step 1: Understand booking conflict concept

   Booking conflict resolution ensures no two bookings overlap for the same resource.

2. Step 2: Identify the goal of conflict resolution

   The goal is to prevent double-booking by checking time overlaps and rejecting or adjusting conflicting bookings.

3. Final Answer:

   To prevent overlapping reservations for the same resource -> Option D

4. Quick Check:

   Conflict resolution = prevent overlaps [OK]

Hint: Conflict resolution means no double bookings allowed [OK]

Common Mistakes:

• Thinking multiple bookings at same time are allowed
• Assuming conflict resolution deletes bookings
• Ignoring time overlaps in bookings

2. Which of the following code snippets correctly checks if two time intervals (start1, end1) and (start2, end2) overlap?

easy

A. if start1 < end2 and start2 < end1: overlap

B. if start1 > end2 or start2 > end1: overlap

C. if end1 <= start2 or end2 <= start1: no overlap

D. if start1 == end2 or start2 == end1: overlap

Solution

1. Step 1: Understand time interval overlap condition

   Two intervals overlap if one starts before the other ends and vice versa.

2. Step 2: Match condition to code

   Condition start1 < end2 and start2 < end1 correctly detects overlap.

3. Final Answer:

   if start1 < end2 and start2 < end1: overlap -> Option A

4. Quick Check:

   Overlap check = start1 < end2 and start2 < end1 [OK]

Hint: Overlap if intervals cross each other in time [OK]

Common Mistakes:

• Using <= instead of < causing false negatives
• Confusing no overlap with overlap conditions
• Checking equality as overlap incorrectly

3. Given existing bookings: [(10, 12), (14, 16), (18, 20)], what will be the result of checking a new booking (12, 14) for conflict using the overlap condition start1 < end2 and start2 < end1?

medium

A. Conflict with (10, 12)

B. Conflict with (14, 16)

C. No conflict

D. Conflict with all existing bookings

Solution

1. Step 1: Check overlap with each existing booking

   Check (12,14) against (10,12): 12 < 12 is false, no overlap. Against (14,16): 12 < 16 true, 14 < 14 false, no overlap. Against (18,20): no overlap.

2. Step 2: Determine conflict result

   No overlaps found with any existing booking intervals.

3. Final Answer:

   No conflict -> Option C

4. Quick Check:

   New booking fits between existing without overlap [OK]

Hint: Check each existing booking for overlap carefully [OK]

Common Mistakes:

• Assuming touching intervals overlap
• Ignoring strict less than condition
• Confusing start and end times

4. Identify the bug in this booking conflict check code snippet:

def is_conflict(new_start, new_end, existing_bookings):
    for start, end in existing_bookings:
        if new_start <= end and new_end >= start:
            return True
    return False

medium

A. The condition incorrectly uses <= and >= causing false conflicts

B. The condition allows bookings that end exactly when another starts

C. The function does not return anything

D. The loop does not iterate over bookings

Solution

1. Step 1: Analyze the overlap condition

   Condition new_start <= end and new_end >= start includes cases where bookings just touch at edges, causing false conflicts.

2. Step 2: Correct condition for strict overlap

   Use new_start < end and new_end > start to detect true overlaps only.

3. Final Answer:

   The condition incorrectly uses <= and >= causing false conflicts -> Option A

4. Quick Check:

   Use strict inequalities for overlap [OK]

Hint: Use < and >, not <= or >= for overlap checks [OK]

Common Mistakes:

• Using inclusive operators causing false positives
• Forgetting to return a boolean
• Not iterating over all bookings

5. You are designing a booking system for meeting rooms. To handle conflict resolution at scale, which approach is best to ensure no overlapping bookings and high performance?

hard

A. Use a centralized lock on the entire booking database for each new booking

B. Check for conflicts by querying only relevant time slots and use optimistic concurrency control

C. Allow all bookings and resolve conflicts manually later

D. Store bookings without timestamps and rely on user honesty

Solution

1. Step 1: Understand scalability and conflict resolution needs

   Centralized locking (Use a centralized lock on the entire booking database for each new booking) causes bottlenecks; manual or no checks (Options C, D) cause errors.

2. Step 2: Choose efficient conflict detection method

   Querying only relevant time slots reduces load; optimistic concurrency control handles race conditions efficiently.

3. Final Answer:

   Check for conflicts by querying only relevant time slots and use optimistic concurrency control -> Option B

4. Quick Check:

   Efficient conflict check + concurrency control = scalable solution [OK]

Hint: Query relevant slots + optimistic control for scalable conflict resolution [OK]

Common Mistakes:

• Using global locks causing slowdowns
• Ignoring concurrency issues
• Not filtering bookings by time before checking