str accessor for string methods in Pandas - Time & Space Complexity

Time Complexity: str accessor for string methods

O(n)

Understanding Time Complexity

We want to understand how the time needed to run string methods on pandas columns changes as the data grows.

How does the work increase when we have more text entries to process?

Scenario Under Consideration

Analyze the time complexity of the following code snippet.

import pandas as pd

df = pd.DataFrame({
    'names': ['Alice', 'Bob', 'Charlie', 'David', 'Eva'] * 1000
})
df['upper_names'] = df['names'].str.upper()

This code converts all names in the 'names' column to uppercase using the str accessor.

Identify Repeating Operations

Identify the loops, recursion, array traversals that repeat.

• Primary operation: Applying the string method upper() to each element in the column.
• How many times: Once for each row in the DataFrame, so as many times as there are entries.

How Execution Grows With Input

As the number of rows increases, the total work grows roughly in direct proportion.

Input Size (n)	Approx. Operations
10	10 string conversions
100	100 string conversions
1000	1000 string conversions

Pattern observation: Doubling the number of rows roughly doubles the work done.

Final Time Complexity

Time Complexity: O(n)

This means the time to run the string method grows linearly with the number of rows.

Common Mistake

[X] Wrong: "Using the str accessor runs the string method only once for the whole column."

[OK] Correct: Each string in the column is processed separately, so the method runs once per row, not just once total.

Interview Connect

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

Self-Check

What if we changed the string method to one that also scans the whole string, like contains()? How would the time complexity change?