Implement a Bounded Per-Key Ordered Task Executor

Read the full interview experience this question came from →

Quick Overview

Implement a thread-safe bounded executor that preserves submission order and prevents overlap per key while allowing at most four tasks to run globally. Define atomic admission, cancellation, error handling, worker coordination, and deadline-bounded shutdown behavior.

Implement a Bounded Per-Key Ordered Task Executor

Company: Microsoft

Role: Software Engineer

Category: Software Engineering Fundamentals

Difficulty: medium

Interview Round: Technical Screen

Overview: Implement a thread-safe bounded executor that preserves submission order and prevents overlap per key while allowing at most four tasks to run globally. Define atomic admission, cancellation, error handling, worker coordination, and deadline-bounded shutdown behavior.

Read the full Microsoft Software Engineer interview experience this question came from

|Home/Software Engineering Fundamentals/Microsoft
Microsoft logo
Microsoft
Aug 2, 2026
mediumSoftware EngineerTechnical ScreenSoftware Engineering Fundamentals
2
0
Loading...
Loading comments...