How hard is LeetCode 434. Number of Segments in a String?

LeetCode 434. Number of Segments in a String is rated Easy on LeetCode.

What is the time complexity of LeetCode 434. Number of Segments in a String?

The Python solution on this page runs in O(n).

What is the space complexity of LeetCode 434. Number of Segments in a String?

The Python solution on this page uses O(n), where n is the length of the string \textit{s} auxiliary space.

What topics does LeetCode 434. Number of Segments in a String cover?

LeetCode 434. Number of Segments in a String is tagged String on LeetCode.

Number of Segments in a String — LeetCode 434 Python Solution

EasyString

Problem: #434
Pattern: Hash Map
Reading time: 2 min
Source: leetcode.com

The problem

Given a string s, return the number of segments in the string. A segment is defined to be a contiguous sequence of non-space characters.

Example

Input: s = "Hello, my name is John"
Output: 5
Explanation: The five segments are ["Hello,", "my", "name", "is", "John"]

Python solution

Python

class Solution:
    def countSegments(self, s: str) -> int:
        return len(s.split())

Complexity

Measure	Complexity
Time	O(n)
Space	O(n), where n is the length of the string \textit{s} auxiliary

Pattern: Hash Map

Trade memory for time: remember what you have seen so the second pass never happens. LeetCode 434. Number of Segments in a String is filed here because the reference solution below belongs to the algorithm family this hub collects, even though its LeetCode tags point elsewhere.

The hash map guide has the Python template for the pattern and the 709 LeetCode problems that use it.

Frequently asked questions

How hard is LeetCode 434. Number of Segments in a String?: LeetCode 434. Number of Segments in a String is rated Easy on LeetCode.
What is the time complexity of LeetCode 434. Number of Segments in a String?: The Python solution on this page runs in O(n).
What is the space complexity of LeetCode 434. Number of Segments in a String?: The Python solution on this page uses O(n), where n is the length of the string \textit{s} auxiliary space.
What topics does LeetCode 434. Number of Segments in a String cover?: LeetCode 434. Number of Segments in a String is tagged String on LeetCode.