Satisfies operator in Typescript - Time & Space Complexity

Time Complexity: Satisfies operator

O(n)

Understanding Time Complexity

We want to see how the time it takes to check if a value meets a type condition changes as the input grows.

How does using the satisfies operator affect the work done when checking types?

Scenario Under Consideration

Analyze the time complexity of the following code snippet.

const colors = ["red", "green", "blue"] as const;

const color = "red" satisfies (typeof colors)[number];

const bigArray = Array(1000).fill("red") as const;

const check = bigArray.every(c => (c satisfies (typeof colors)[number], true));
    

This code uses the satisfies operator to check if values match a specific type from a list.

Identify Repeating Operations

Identify the loops, recursion, array traversals that repeat.

• Primary operation: The every method loops over each item in bigArray to check the type with satisfies.
• How many times: It runs once for each element, so 1000 times in this example.

How Execution Grows With Input

Each new item in the array adds one more check using the satisfies operator.

Input Size (n)	Approx. Operations
10	10 type checks
100	100 type checks
1000	1000 type checks

Pattern observation: The number of operations grows directly with the number of items checked.

Final Time Complexity

Time Complexity: O(n)

This means the time to check all items grows in a straight line as the list gets bigger.

Common Mistake

[X] Wrong: "The satisfies operator runs instantly no matter how many items there are."

[OK] Correct: Each item must be checked one by one, so more items mean more work.

Interview Connect

Understanding how type checks scale helps you write efficient code and explain your reasoning clearly in interviews.

Self-Check

"What if we replaced the array with a Set? How would the time complexity of checking all items change?"