We use cookies (including Google cookies) to personalize ads and analyze traffic. By continuing to use our site, you accept our Privacy Policy.

SimplyLeet
TagsDisclaimersPrivacyTermsContactAbout Us

Number of Segments in a String

Difficulty: Easy

Problem Description

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.

Key Insights

  • A segment is formed by characters that are not spaces.
  • Segments are separated by one or more spaces.
  • Leading and trailing spaces should not contribute to the segment count.
  • The problem can be solved by counting occurrences of non-space characters between spaces.

Space and Time Complexity

Time Complexity: O(n), where n is the length of the string. We traverse the string once. Space Complexity: O(1), as we use a constant amount of space for counting.

Solution

To solve this problem, we can traverse the string and count the number of segments by checking for transitions from space to non-space characters. We keep track of whether we are currently in a segment and increment our count whenever we detect the start of a new segment.

Code Solutions

def countSegments(s: str) -> int:
    count = 0
    in_segment = False
    
    for char in s:
        if char != ' ':
            if not in_segment:
                count += 1
                in_segment = True
        else:
            in_segment = False
    
    return count
← Back to All Questions