Amazon (AWS) | SDE-2 | Phone Screen

Round 1: Online Assessment

Questions:

1. Given the number of movie series watched, find the minimum subarray that includes series1 and series2. The minimum subarray is counted based on the number of distinct elements in it.
   Example:
   s1 = 1
   s2 = 2
   watched = [1, 3, 2, 1, 4]
   Output: [2, 1]

2. Given an array, find the maximum possible number after performing a specific operation:
   Remove the smallest element from the array.
   Replace it with the sum of its adjacent elements (idx-1 + idx+1).
   Example:
   charge = [-2, 4, 3, -2, 1]
   Step 1: Remove idx 0 (-2) → [4, 3, -2, 1]
   Step 2: Remove idx 2 (-2) → [4, 4]

Round 2: Phone Screen

Questions:

1. Leadership Principles: Customer Satisfaction & Dealing with Setbacks (30 min)
2. Design a Task Scheduler to append tasks and fetch them based on priority (30 min)
   Example:

class Task:
    def __init__(self, id, priority, code):
        self.id = id
        self.priority = priority
        self.code = code

class TaskScheduler:
    def add(task):  # Add a task
    def fetch():  
        # Fetch task with the highest priority