String type behavior in Typescript - Time & Space Complexity

Time Complexity: String type behavior

O(n)

Understanding Time Complexity

We want to understand how the time to work with strings changes as the string gets longer.

How does the length of a string affect the time it takes to do common operations?

Scenario Under Consideration

Analyze the time complexity of the following code snippet.

function countChars(str: string, charToCount: string): number {
  let count = 0;
  for (let i = 0; i < str.length; i++) {
    if (str[i] === charToCount) {
      count++;
    }
  }
  return count;
}
    

This code counts how many times a specific character appears in a string.

Identify Repeating Operations

Identify the loops, recursion, array traversals that repeat.

• Primary operation: Looping through each character of the string once.
• How many times: Exactly once for each character in the string (str.length times).

How Execution Grows With Input

As the string gets longer, the time to count characters grows in a straight line.

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

Pattern observation: Doubling the string length doubles the work needed.

Final Time Complexity

Time Complexity: O(n)

This means the time to count characters grows directly with the string length.

Common Mistake

[X] Wrong: "Accessing a character in a string is slow and adds extra loops."

[OK] Correct: Accessing a character by index is fast and does not add loops; the main time is from the single loop over the string.

Interview Connect

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

Self-Check

"What if we searched for a substring instead of a single character? How would the time complexity change?"